Abstract
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.
Cite
CITATION STYLE
Endrullis, J., Karhumäki, J., Klop, J. W., & Saarela, A. (2016). Degrees of infinite words, polynomials and atoms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9840, pp. 164–176). Springer Verlag. https://doi.org/10.1007/978-3-662-53132-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
