On automatic infinite permutations

An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships between these definitions and prove that they constitute a chain of inclusions. We also construct and study an automaton generating the Thue-Morse permutation.

[1]  Jean Berstel.  Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. , 2004, SIGA.

[2]  Anna E. Frid,et al.  On periodicity and low complexity of infinite permutations , 2007, Eur. J. Comb..

[3]  Jeffrey Shallit,et al.  Periodicity, repetitions, and orbits of an automatic sequence , 2008, Theor. Comput. Sci..

[4]  G. Rauzy,et al.  Suites algébriques, automates et substitutions , 1980 .

[5]  M. Makarov.  On the infinite permutation generated by the period doubling word , 2010, Eur. J. Comb..

[6]  Steven Widmer.  Permutation complexity of the Thue-Morse word , 2011, Adv. Appl. Math..

[7]  Jeffrey Shallit,et al.  Automatic Sequences: Cobham's Theorem , 2003 .

[8]  Sergey V. Avgustinovich,et al.  Infinite permutations of lowest maximal pattern complexity , 2011, Theor. Comput. Sci..

[9]  M. A. Makarov.  On the permutations generated by Sturmian words , 2009 .

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

[11]  Ronald L. Graham,et al.  On permutations containing no long arithmetic progressions , 1977 .

[12]  Berndt Farwer,et al.  ω-automata , 2002 .

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

[14]  Sébastien Ferenczi,et al.  Complexity of sequences and dynamical systems , 1999, Discret. Math..

[15]  Jeffrey Shallit,et al.  Enumeration and Decidable Properties of Automatic Sequences , 2011, Developments in Language Theory.

[16]  Alan Cobham,et al.  Uniform tag sequences , 1972, Mathematical systems theory.

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

[18]  M. A. Makarov.  On an infinite permutation similar to the Thue-Morse word , 2009, Discret. Math..