Semiautomatic Structures

Semiautomatic structures generalise automatic structures in the sense that for some of the relations and functions in the structure one only requires the derived relations and functions are automatic when all but one input are filled with constants. One can also permit that this applies to equality in the structure so that only the sets of representatives equal to a given element of the structure are regular while equality itself is not an automatic relation on the domain of representatives. It is shown that one can find semiautomatic representations for the field of rationals and also for finite algebraic field extensions of it. Furthermore, one can show that infinite algebraic extensions of finite fields have semiautomatic representations in which the addition and equality are both automatic. Further prominent examples of semiautomatic structures are term algebras, any relational structure over a countable domain with a countable signature and any permutation algebra with a countable domain. Furthermore, examples of structures which fail to be semiautomatic are provided.

[1]  Yuri Matiyasevich,et al.  Hilbert's tenth problem , 1993 .

[2]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

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

[4]  B. H. Neumann,et al.  On Ordered Groups , 1949 .

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  Sanjay Jain,et al.  Learning Pattern Languages over Groups , 2016, ALT.

[7]  A. L. Semenov,et al.  Presburgerness of predicates regular in two number systems , 1977 .

[8]  Sanjay Jain,et al.  Finitely generated semiautomatic groups , 2018, Comput..

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

[10]  Lionnet Solution d'un problème d'arithmétique , 1843 .

[11]  John Case,et al.  Automatic functions, linear time and learning , 2013, Log. Methods Comput. Sci..

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

[13]  Sanjay Jain,et al.  Semiautomatic Structures , 2017, Theory of Computing Systems.

[14]  A. Myasnikov,et al.  Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic , 2012, LATA.

[15]  André Nies,et al.  Describing Groups , 2007, Bulletin of Symbolic Logic.

[16]  L. Fuchs Partially Ordered Algebraic Systems , 2011 .

[17]  A. Nies,et al.  FA-presentable groups and rings , 2008 .

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

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

[20]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[21]  Alexei G. Myasnikov,et al.  From automatic structures to automatic groups , 2011, ArXiv.

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

[23]  Alan Cobham,et al.  On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

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