Some problems in automata theory which depend on the models of set theory

Finkel, Olivier

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).

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

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

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

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

[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 | Zbl

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

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

[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 | Zbl

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

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

[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 | Zbl

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

[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 | Zbl

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

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

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

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

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

[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

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

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

[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 | Zbl

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

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

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

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

[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 | Zbl