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