The Isomorphism Problem for omega-Automatic Trees

The main result of this paper is that the isomorphism for omega-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalban, and Nies showing that the isomorphism problem for omega-automatic structures is not $\Sigma^1_2$. Moreover, assuming the continuum hypothesis CH, we can show that the isomorphism problem for omega-automatic trees of finite height is recursively equivalent with second-order arithmetic. On the way to our main results, we show lower and upper bounds for the isomorphism problem for omega-automatic trees of every finite height: (i) It is decidable ($\Pi^0_1$-complete, resp,) for height 1 (2, resp.), (ii) $\Pi^1_1$-hard and in $\Pi^1_2$ for height 3, and (iii) $\Pi^1_{n-3}$- and $\Sigma^1_{n-3}$-hard and in $\Pi^1_{2n-4}$ (assuming CH) for all n > 3. All proofs are elementary and do not rely on theorems from set theory.

[1]  André Nies,et al.  Automatic structures: richness and limitations , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[2]  Juha Honkala On the Problem Whether the Image of an N-Rational Series Equals , 2006, Fundam. Informaticae.

[3]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[4]  Olivier Finkel Highly Undecidable Problems For Infinite Computations , 2009, RAIRO Theor. Informatics Appl..

[5]  Sasha Rubin,et al.  Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

[6]  Dietrich Kuske Where Automatic Structures Benefit from Weighted Automata , 2011, Algebraic Foundations in Computer Science.

[7]  D. Kuske,et al.  First-order and counting theories of ω-automatic structures , 2008, Journal of Symbolic Logic.

[8]  A. Kechris Classical descriptive set theory , 1987 .

[9]  Greg Hjorth,et al.  From Automatic Structures to Borel Structures , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[10]  Yuri Matiyasevich,et al.  Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.

[11]  Markus Lohrey,et al.  Some natural decision problems in automatic graphs , 2010, J. Symb. Log..

[12]  Markus Lohrey,et al.  The Isomorphism Problem on Classes of Automatic Structures , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[13]  Sasha Rubin,et al.  Automata-based presentations of infinite structures , 2011, Finite and Algorithmic Model Theory.

[14]  P. Odifreddi Classical recursion theory , 1989 .

[15]  Olivier Finkel,et al.  The isomorphism relation between tree-automatic Structures , 2010, ArXiv.

[16]  Bruno Courcelle,et al.  The Definability of Equational Graphs in Monadic Second-Order Logic , 1989, ICALP.

[17]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[18]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[20]  Achim Blumensath,et al.  Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.

[21]  Dietrich Kuske,et al.  IS RAMSEY'S THEOREM ω- AUTOMATIC? , 2010 .

[22]  Frank Stephan,et al.  Automatic linear orders and trees , 2005, TOCL.

[23]  Yaacov Choueka,et al.  Theories of Automata on omega-Tapes: A Simplified Approach , 1974, J. Comput. Syst. Sci..

[24]  Sasha Rubin,et al.  Some results on automatic structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[25]  S. Goncharov,et al.  Computable Structure and Non-Structure Theorems , 2002 .

[26]  P. Odifreddi The theory of functions and sets of natural numbers , 1989 .

[27]  Thomas Colcombet,et al.  Bounds in w-Regularity , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[28]  Julia F. Knight,et al.  Classification from a Computable Viewpoint , 2006, Bulletin of Symbolic Logic.

[29]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).