𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Büchi automata for modeling component connectors

✍ Scribed by Mohammad Izadi; Marcello Bonsangue; Dave Clarke

Book ID
106305160
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
893 KB
Volume
10
Category
Article
ISSN
1619-1366

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unambiguous Büchi automata
Unambiguous Büchi automata
✍ Olivier Carton; Max Michel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 428 KB

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

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.