Some problems in automata theory which depend on the models of set theory
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011) no. 4, pp. 383-397.

We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an $\omega$-language $L\left(𝒜\right)$ accepted by a Büchi 1-counter automaton $𝒜$. We prove the following surprising result: there exists a 1-counter Büchi automaton $𝒜$ such that the cardinality of the complement $L{\left(𝒜\right)}^{-}$ of the $\omega$-language $L\left(𝒜\right)$ is not determined by ZFC: (1) There is a model ${V}_{1}$ of ZFC in which $L{\left(𝒜\right)}^{-}$ is countable. (2) There is a model ${V}_{2}$ of ZFC in which $L{\left(𝒜\right)}^{-}$ has cardinal ${2}^{{\aleph }_{0}}$. (3) There is a model ${V}_{3}$ of ZFC in which $L{\left(𝒜\right)}^{-}$ has cardinal ${\aleph }_{1}$ with ${\aleph }_{0}<{\aleph }_{1}<{2}^{{\aleph }_{0}}$. We prove a very similar result for the complement of an infinitary rational relation accepted by a 2-tape Büchi automaton ℬ. As a corollary, this proves that the continuum hypothesis may be not satisfied for complements of 1-counter $\omega$-languages and for complements of infinitary rational relations accepted by 2-tape Büchi automata. We infer from the proof of the above results that basic decision problems about 1-counter $\omega$-languages or infinitary rational relations are actually located at the third level of the analytical hierarchy. In particular, the problem to determine whether the complement of a 1-counter $\omega$-language (respectively, infinitary rational relation) is countable is in ${\Sigma }_{3}^{1}\setminus {\Pi }_{2}^{1}\cup {\Sigma }_{2}^{1}$. This is rather surprising if compared to the fact that it is decidable whether an infinitary rational relation is countable (respectively, uncountable).

DOI : https://doi.org/10.1051/ita/2011113
Classification : 68Q45,  68Q15,  03D05,  03D10
Mots clés : automata and formal languages, logic in computer science, computational complexity, infinite words, ω-languages, 1-counter automaton, 2-tape automaton, cardinality problems, decision problems, analytical hierarchy, largest thin effective coanalytic set, models of set theory, independence from the axiomatic system ZFC
@article{ITA_2011__45_4_383_0,
author = {Finkel, Olivier},
title = {Some problems in automata theory which depend on the models of set theory},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {383--397},
publisher = {EDP-Sciences},
volume = {45},
number = {4},
year = {2011},
doi = {10.1051/ita/2011113},
zbl = {1232.68082},
mrnumber = {2876113},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ita/2011113/}
}
TY  - JOUR
AU  - Finkel, Olivier
TI  - Some problems in automata theory which depend on the models of set theory
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2011
DA  - 2011///
SP  - 383
EP  - 397
VL  - 45
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita/2011113/
UR  - https://zbmath.org/?q=an%3A1232.68082
UR  - https://www.ams.org/mathscinet-getitem?mr=2876113
UR  - https://doi.org/10.1051/ita/2011113
DO  - 10.1051/ita/2011113
LA  - en
ID  - ITA_2011__45_4_383_0
ER  -
Finkel, Olivier. Some problems in automata theory which depend on the models of set theory. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011) no. 4, pp. 383-397. doi : 10.1051/ita/2011113. http://www.numdam.org/articles/10.1051/ita/2011113/

[1] J. Castro and F. Cucker, Nondeterministic ω-computations and the analytical hierarchy. J. Math. Logik Grundl. Math. 35 (1989) 333-342. | MR 1020506 | Zbl 0661.03030

[2] R.S. Cohen and A.Y. Gold, ω-computations on Turing machines. Theoret. Comput. Sci. 6 (1978) 1-23. | MR 465819 | Zbl 0368.68057

[3] O. Finkel, Borel ranks and Wadge degrees of omega context free languages. Math. Structures Comput. Sci. 16 (2006) 813-840. | MR 2268344 | Zbl 1121.03047

[4] O. Finkel, On the accepting power of two-tape Büchi automata, in Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science. STACS 2006. Lect. Notes Comput. Sci. 3884 (2006) 301-312. | MR 2250991 | Zbl 1137.03023

[5] O. Finkel, The complexity of infinite computations in models of set theory. Log. Meth. Comput. Sci. 5 (2009) 1-19. | MR 2575076 | Zbl 1191.03034

[6] O. Finkel, Highly undecidable problems for infinite computations. RAIRO - Theor. Inf. Appl. 43 (2009) 339-364. | Numdam | MR 2512263 | Zbl 1171.03024

[7] O. Finkel, Decision problems for recognizable languages of infinite pictures, in Studies in Weak Arithmetics, Proceedings of the International Conference 28th Weak Arithmetic Days, 2009, Publications of the Center for the Study of Language and Information. Lect. Notes 196 (2010) 127-151. | MR 2681800 | Zbl 1244.03052

[8] F. Gire, Relations rationnelles infinitaires. Ph.D. thesis, Université Paris VII (1981). | Zbl 0552.68064

[9] F. Gire and M. Nivat, Relations rationnelles infinitaires. Calcolo XXI (1984) 91-125. | MR 799616 | Zbl 0552.68064

[10] E. Grädel, W. Thomas and W. Wilke Eds., Automata, Logics, and Infinite Games : A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]. Lect. Notes Comput. Sci. 2500 (2002). | MR 2070731 | Zbl 1011.00037

[11] Y. Gurevich, M. Magidor and S. Shelah, The monadic theory of ω2. J. Symbolic Logic 48 (1983) 387-398. | MR 704093 | Zbl 0549.03010

[12] J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Co., Reading, Mass. Addison-Wesley Series in Computer Science (2001). | MR 645539 | Zbl 0980.68066

[13] T. Jech, Set Theory, 3rd edition. Springer (2002). | MR 1492987 | Zbl 1007.03002

[14] A. Kanamori, The Higher Infinite. Springer-Verlag (1997). | Zbl 0813.03034

[15] A.S. Kechris, The theory of countable analytical sets. Trans. Amer. Math. Soc. 202 (1975) 259-297. | MR 419235 | Zbl 0317.02082

[16] D. Kuske and M. Lohrey, First-order and counting theories of omega-automatic structures. J. Symbolic Logic 73 (2008) 129-150. | MR 2387935 | Zbl 1141.03015

[17] L.H. Landweber, Decision problems for ω-automata. Math. Syst. Theor. 3 (1969) 376-384. | MR 260595 | Zbl 0182.02402

[18] H. Lescow and W. Thomas, Logical specifications of infinite computations, in A Decade of Concurrency, J.W. de Bakker, W.P. de Roever and G. Rozenberg, Eds. Lect. Notes Comput. Sci. 803 (1994) 583-621. | MR 1292687

[19] Y.N. Moschovakis, Descriptive set theory. North-Holland Publishing Co., Amsterdam (1980). | MR 561709 | Zbl 0433.03025

[20] I. Neeman, Finite state automata and monadic definability of singular cardinals. J. Symbolic Logic 73 (2008) 412-438. | MR 2414457 | Zbl 1148.03030

[21] D. Niwinski, On the cardinality of sets of infinite trees recognizable by finite automata, in Proceedings of the International Conference MFCS. Lect. Notes Comput. Sci. 520 (1991) 367-376. | MR 1135376 | Zbl 0776.68086

[22] D. Perrin and J.-E. Pin, Infinite words, automata, semigroups, logic and games. Pure Appl. Math. 141 (2004). | Zbl 1094.68052

[23] H. Rogers, Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967). | MR 224462 | Zbl 0183.01401

[24] L. Staiger, Hierarchies of recursive ω-languages. Elektronische Informationsverarbeitung und Kybernetik 22 (1986) 219-241. | MR 855527 | Zbl 0627.03024

[25] L. Staiger, ω-languages, in Handbook of formal languages 3. Springer, Berlin (1997) 339-387. | MR 1470023

[26] W. Thomas, Automata on infinite objects, in Handbook of Theoretical Computer Science B, Formal models and semantics. J. van Leeuwen, Ed. Elsevier (1990) 135-191. | MR 1127189 | Zbl 0900.68316

Cité par Sources :