Geodesic
Decidability conditions for problems about automata reading infinite words
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 2, pp. 3-18.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: infinite word, regular language, algorithmic decidability, monadic theory. 
@article{DA_2012_19_2_a0,
     author = {M. N. Vyalyi and A. A. Rubtsov},
     title = {Decidability conditions for problems about automata reading infinite words},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--18},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_2_a0/}
}
TY  - JOUR
AU  - M. N. Vyalyi
AU  - A. A. Rubtsov
TI  - Decidability conditions for problems about automata reading infinite words
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 3
EP  - 18
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_2_a0/
LA  - ru
ID  - DA_2012_19_2_a0
ER  - 
%0 Journal Article
%A M. N. Vyalyi
%A A. A. Rubtsov
%T Decidability conditions for problems about automata reading infinite words
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 3-18
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_2_a0/
%G ru
%F DA_2012_19_2_a0
M. N. Vyalyi; A. A. Rubtsov. Decidability conditions for problems about automata reading infinite words. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 2, pp. 3-18. http://geodesic.mathdoc.fr/item/DA_2012_19_2_a0/

[1] Vyalyi M. N., “O modelyakh nedeterminizma dlya dvustoronnikh avtomatov”, Tr. VIII mezhdunar. konf. “Diskretnye modeli v teorii upravlyayuschikh sistem”, MaksPress, M., 2009, 54–60

[2] Vyalyi M. N., Tarasov S. P., “Orbity lineinykh otobrazhenii i svoistva regulyarnykh yazykov”, Diskret. analiz i issled. operatsii, 17:6 (2010), 20–49 | MR | Zbl

[3] Muchnik An. A., Pritykin Yu. L., Semenov A. L., “Posledovatelnosti, blizkie k periodicheskim”, Uspekhi mat. nauk, 64:5 (2009), 21–96 | MR | Zbl

[4] Semenov A. L., “Logicheskie teorii odnomestnykh funktsii na naturalnom ryade”, Izv. AN SSSR. Ser. mat., 47:3 (1983), 623–658 | MR | Zbl

[5] Bailey D. H., Crandall R. E., “On the random character of fundamental constant expansions”, Exp. Math., 10:2 (2001), 175–190 | DOI | MR | Zbl

[6] Bárány V., “A hierarchy of automatic $\omega$-words having a decidable MSO theory”, Theor. Inform. Appl., 42 (2008), 417–450 | DOI | MR | Zbl

[7] Büchi J. R., “On a decision method in restricted second-order arithmetic”, Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Stanford Univ. Press, Palo Alto, 1962, 1–11 | MR

[8] Carton O., Thomas W., “The monadic theory of morphic infinite words and generalizations”, Inf. Comput., 176:1 (2002), 51–65 | DOI | MR | Zbl

[9] McNaughton R., “Testing and generating infinite sequences by a finite automaton”, Inf. Control, 9 (1966), 521–530 | DOI | MR | Zbl

[10] Roggenbach M., “Determinization of Büchi-automata”, Automata, logics, and infinite games, Lect. Notes Comput. Sci., 2500, Springer-Verl., New York–Heidelberg–Berlin, 2002, 43–60 | DOI | MR | Zbl

[11] Vyalyi M. N., “On models of a nondeterministic computation”, Proc. CSR 2009, Lect. Notes Comput. Sci., 5675, Springer-Verl., New York–Heidelberg–Berlin, 2009, 334–345 | DOI | Zbl