On the complementation of Büchi automata
✍ Scribed by Jean-Pierre Pecuchet
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 189 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we introduce a special class of B uchi automata called unambiguous. In these automata, any inÿnite word labels exactly one path going inÿnitely often through ÿnal states. The word is recognized by the automaton if this path starts in an initial state. The main result of the paper is t
We show that a language of infinite binary trees is definable by a Σ 2 -formula of the monadic second order logic of two successors (with no additional symbols) iff it can be accepted by a Büchi automaton. The same result has been obtained by G. Lenzi, but our proof is simpler.
Diphenyloxetane was synthesized from photocycloaddition of benzaldehyde and styrene. The oxetane products, 2,3 trans and 2,3 cis isomers, were observed in a 3:1 ratio. Irradiation of 1-phenylpropene and trimethylsilyl cinnamyl ether under the same conditions also gave oxetanes. The silyl group resul