#### Filter Results:

#### Publication Year

1978

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Brain Region

#### Cell Type

#### Organism

Learn More

We measured changes in regional cerebral blood flow (rCBF) induced by reading, naming, and the Stroop effect in 12 right-handed normal volunteers. rCBF was quantified with a single-photon emission computerized tomograph after intravenous injection of 133Xe. Data were analyzed using predetermined regions of interest and a linear model. A significant relative… (More)

We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of languages indexed by countable scattered linear orderings, but false in the general case. As a corollary we prove that the inclusion problem for rational languages of words indexed by… (More)

In a preceding paper, Bruyère and Carton introduced automata, as well as rational expressions, which allow to deal with words indexed by linear orderings. A Kleene-like theorem was proved for words indexed by countable scattered linear orderings. In this paper we extend this result to languages of words indexed by all linear orderings.

- J Touchon, L Bertin, A J Pilgrim, E Ashford, A Bès
- Neurology
- 1996

We compared the efficacy and safety of subcutaneous (SC) sumatriptan (6 mg) with that of dihydroergotamine (DHE) nasal spray (1 mg plus optional 1 mg) in the acute treatment of migraine. Two hundred sixty-six adult migraineurs (International Headache Society criteria) completed a multicenter, double-blind, double-dummy, cross-over study. Patients took SC… (More)

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations. We also consider a slight extension of the Feferman-Vaught formalism which allows to express more relations… (More)

We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable.

Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type ω or −ω, and the monadic second-order theory of M is decidable, then there exists a non-trivial expansion M ′ of M by a monadic predicate such that the monadic second-order theory of M ′ is… (More)