Degrees of Infinite Words, Polynomials and Atoms

Our objects of study are finite state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite automata for recognising and transforming languages are well-understood, very little is known about the power of automata to transform infinite words. We use methods from linear algebra and analysis to show that there is an infinite number of atoms in the transducer degrees, that is, minimal non-trivial degrees.

[1]  Robert van Wesep,et al.  Wadge Degrees and Projective Ordinals: The Cabal Seminar, Volume II: Wadge degrees and descriptive set theory , 1978 .

[2]  Hans Zantema,et al.  The Degree of Squares is an Atom , 2015, WORDS.

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

[4]  Juhani Karhumäki,et al.  Degrees of Infinite Words, Polynomials and Atoms , 2018, Int. J. Found. Comput. Sci..

[5]  R. Jackson.  Inequalities , 2007, Algebra for Parents.

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

[7]  Juhani Karhumäki,et al.  Degrees of Infinite Words, Polynomials, and Atoms (Extended Version) , 2018, ArXiv.

[8]  Olivier Carton,et al.  Operations preserving regular languages , 2006, Theor. Comput. Sci..

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

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

[11]  Gerhard Rayna,et al.  Degrees of Finite-State Transformability , 1974, Inf. Control..

[12]  Alexandra Silva,et al.  A Coinductive Framework for Infinitary Rewriting and Equational Reasoning , 2015, RTA.

[13]  Konrad Jacobs.  Invitation to Mathematics , 1992 .

[14]  Aleksandrs Belovs,et al.  Some Algebraic Properties of Machine Poset of Infinite Words , 2008, RAIRO Theor. Informatics Appl..

[15]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[16]  Jörg Endrullis,et al.  On periodically iterated morphisms , 2014, CSL-LICS.

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

[18]  Hans Zantema,et al.  Ordering sequences by permutation transducers , 2017 .

[19]  Benedikt Löwe.  Complexity hierarchies derived from reduction functions , 2001, FotFS.

[20]  Joseph R. Shoenfield,et al.  Degrees of unsolvability , 1959, North-Holland mathematics studies.

[21]  Jörg Endrullis,et al.  Lazy productivity via termination , 2011, Theor. Comput. Sci..

[22]  Markus A. Whiteland,et al.  Degrees of Transducibility , 2015, WORDS.

[23]  Jan Willem Klop,et al.  Degrees of Streams , 2011, Integers.

[24]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .