Volume 19, No 2, 2012, P. 3-18
M. N. Vyalyi, A. A. Rubtsov
Decidability conditions for problems about automata reading infinite words
We consider two algorithmic problems related to the automata on infinite words: does an automaton reach an accepting state while reading an infinite word and does this event occurs infinitely often. The former problem is related to generalized nondeterminism models and the latter, to decidability of monadic second order theories. The main contribution is a new decidability condition for these problems. We also show that decidability of a regular realizability problem (satisfiability of a regular property on a set of words) is equivalent to decidability of the first problem.
Keywords: infinite word, regular language, algorithmic decidability, monadic theory.
Vyalyi Mikhail Nikolaevich 1
Rubtsov Alexander Alexandrovich 2
1. Dorodnicyn Computing Centre, RAS,
40 Vavilova str., 119333 Moscow, Russia
Moscow Institute of Physics and Technology,
9 Institutskii per., 141700 Dolgoprudny, Russia
e-mail: firstname.lastname@example.org, email@example.com