This article is cited in 2 scientific papers (total in 2 papers)
Decidability conditions for problems about automata reading infinite words
M. N. Vyalyia, A. A. Rubtsovb
a Dorodnicyn Computing Centre, RAS, Moscow, Russia
b Moscow Institute of Physics and Technology, Dolgoprudny, Russia
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. Bibliogr. 11.
infinite word, regular language, algorithmic decidability, monadic theory.
PDF file (292 kB)
M. N. Vyalyi, A. A. Rubtsov, “Decidability conditions for problems about automata reading infinite words”, Diskretn. Anal. Issled. Oper., 19:2 (2012), 3–18
Citation in format AMSBIB
\by M.~N.~Vyalyi, A.~A.~Rubtsov
\paper Decidability conditions for problems about automata reading infinite words
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
N. N. Korneeva, “Automata transformations of prefix decidable and decidable by Buchi superwords”, Russian Math. (Iz. VUZ), 60:7 (2016), 47–55
N. N. Korneeva, “The structure of degrees of finite automaton transformations of prefix decidable superwords”, Russian Math. (Iz. VUZ), 60:9 (2016), 79–83
|Number of views:|