Tree-automatic scattered linear orders

Tree-automatic linear orders on regular tree languages are studied. It is shown that there is no tree-automatic scattered linear order, and therefore no tree-automatic well-order, on the set of all finite labeled trees, and that a regular tree language admits a tree-automatic scattered linear order if and only if for some n, no binary tree of height n can be embedded into the union of the domains of its trees. Hence the problem whether a given regular tree language can be ordered by a scattered linear order or a well-order is decidable. Moreover, sharp bounds for tree-automatic well-orders on some regular tree languages are computed by connecting tree automata with automata on ordinals. The proofs use elementary techniques of automata theory.

[1]  Dietrich Kuske,et al.  Size and Computation of Injective Tree Automatic Presentations , 2011, MFCS.

[2]  D. Siefkes.  Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees , 1972 .

[3]  Countably Complementable,et al.  LINEAR ORDERINGS , 2006 .

[4]  Mia Minnes,et al.  Model-theoretic complexity of automatic structures , 2009, Ann. Pure Appl. Log..

[5]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[6]  J. R. Büchi.  Decision methods in the theory of ordinals , 1965 .

[7]  Todor Tsankov,et al.  The additive group of the rationals does not have an automatic presentation , 2009, The Journal of Symbolic Logic.

[8]  Christof Löding,et al.  MSO on the Infinite Binary Tree: Choice and Order , 2007, CSL.

[9]  Martin Huschenbett.  Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable , 2012, CiE.

[10]  Gábor Braun,et al.  Breaking up Finite Automata Presentable torsion-Free Abelian Groups , 2011, Int. J. Algebra Comput..

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

[12]  Christof Löding,et al.  Transforming structures by set interpretations , 2007, Log. Methods Comput. Sci..

[13]  Markus Lohrey,et al.  The isomorphism problem on classes of automatic structures with transitive relations , 2013 .

[14]  Dietrich Kuske.  Isomorphisms of scattered automatic linear orders , 2012, CSL.

[15]  C. Delhommé.  Automaticité des ordinaux et des graphes homogènes , 2004 .

[16]  Saharon Shelah,et al.  Rabin's uniformization problem , 1983, Journal of Symbolic Logic.

[17]  B. Khoussainov,et al.  Logic Colloquium 2007: Three lectures on automatic structures , 2008, 0809.3430.

[18]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[19]  Olivier Finkel,et al.  A hierarchy of tree-automatic structures , 2011, The Journal of Symbolic Logic.

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

[21]  Anil Nerode,et al.  Open Questions in the Theory of Automatic Structures , 2008, Bull. EATCS.

[22]  Philipp Schlicht,et al.  Pumping for ordinal-automatic structures , 2017, Comput..

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

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

[25]  I. Neeman.  Monadic theories of wellorders , 2008 .

[26]  Bernard R. Hodgson.  On Direct Products of Automaton Decidable Theories , 1982, Theor. Comput. Sci..

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

[28]  Philipp Schlicht,et al.  Automata on ordinals and automaticity of linear orders , 2013, Ann. Pure Appl. Log..

[29]  Markus Lohrey,et al.  The isomorphism problem for ω-automatic trees , 2010, Ann. Pure Appl. Log..

[30]  Martin Huschenbett.  The Rank of Tree-Automatic Linear Orderings , 2013, STACS.

[31]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

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

[33]  André Nies,et al.  Finite automata presentable abelian groups , 2009, Ann. Pure Appl. Log..

[34]  Nicolas Bedon,et al.  Finite Automata and Ordinals , 1996, Theor. Comput. Sci..

[35]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .