Skip to content

Opening book details…

Can I read Unambiguous Büchi automata on EtoBox?

Unambiguous Büchi automata by Olivier Carton; Max Michel is a Computer Science article available to read on EtoBox.

What is Unambiguous Büchi automata about?

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.

Who reads Unambiguous Büchi automata?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Olivier Carton; Max Michel
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)
Published
2003
Language
EN
Field
Computer Science (Physical Sciences)

More by Olivier Carton; Max Michel

Browse all works by Olivier Carton; Max Michel