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.
KeywordsTuring Machine Finite Automaton Weighted Product Turing Degree Infinite Word
- 5.Endrullis, J., Hansen, H.H., Hendriks, D., Polonsky, A., Silva, A.: A coinductive framework for infinitary rewriting and equational reasoning. In: Proceedings of Conference on Rewriting Techniques and Applications (RTA 2015). Schloss Dagstuhl (2015)Google Scholar
- 8.Endrullis, J., Karhumäki, J., Klop, J., Saarela, A.: Degrees of infinite words, polynomials and atoms (extended version). CoRR (2016)Google Scholar