𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unambiguous Büchi automata

✍ Scribed by Olivier Carton; Max Michel

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
428 KB
Volume
297
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

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 that any rational set of inÿnite words is recognized by such an automaton. We give two proofs of this result. We also provide several related results.

📜 SIMILAR VOLUMES

A characterization of Büchi tree automat
A characterization of Büchi tree automata
✍ Jerzy Skurczyński 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

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.

Stereocontrol of Paterno-Büchi photocycl
Stereocontrol of Paterno-Büchi photocycloadditions
✍ Steven A. Fleming; J.Jerry Gao 📂 Article 📅 1997 🏛 Elsevier Science 🌐 French ⚖ 217 KB

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