Invariants of Automatic Presentations and Semi-synchronous Transductions

Automatic structures are countable structures finitely presentable by a collection of automata. We study questions related to properties invariant with respect to the choice of an automatic presentation. We give a negative answer to a question of Rubin concerning definability of intrinsically regular relations by showing that order-invariant first-order logic can be stronger than first-order logic with counting on automatic structures. We introduce a notion of equivalence of automatic presentations, define semi-synchronous transductions, and show how these concepts correspond. Our main result is that a one-to-one function on words preserves regularity as well as non-regularity of all relations iff it is a semi-synchronous transduction. We also characterize automatic presentations of the complete structures of Blumensath and Gradel.

[1]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[2]  Sasha Rubin,et al.  Automatic Structures: Overview and Future Directions , 2003, J. Autom. Lang. Comb..

[3]  Martin Otto,et al.  Epsilon-logic is more expressive than first-order logic over finite structures , 2000, Journal of Symbolic Logic.

[4]  Jacques Sakarovitch,et al.  Synchronized Rational Relations of Finite and Infinite Words , 1993, Theor. Comput. Sci..

[5]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

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

[7]  C. Michaux,et al.  LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .

[8]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[9]  Lauri Hella,et al.  Definability Hierarchies of Generalized Quantifiers , 1989, Ann. Pure Appl. Log..

[10]  André Nies,et al.  Automatic Structures: Richness and Limitations , 2004, LICS.

[11]  Frank Stephan,et al.  Definability and Regularity in Automatic Structures , 2004, STACS.

[12]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[13]  André Nies,et al.  Automatic structures: richness and limitations , 2004, LICS 2004.

[14]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

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

[16]  Alexis Bès.  Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem , 1997, J. Symb. Log..

[17]  Dietrich Kuske,et al.  Is Cantor's Theorem Automatic? , 2003, LPAR.

[18]  Jeffrey Shallit,et al.  Automatic Sequences: Theory, Applications, Generalizations , 2003 .

[19]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

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

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

[22]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

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