Degrees of Infinite Words, Polynomials and Atoms

DOI10.1142/S0129054118420066zbMath1404.68068arXiv1803.03158OpenAlexW2888102682MaRDI QIDQ4683233

Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Juhani Karhumäki

Publication date: 20 September 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.03158

zbMATH Keywords

infinite wordsfinite-state transducersdegrees of infinite words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (2)

Transducer degrees: atoms, infima and suprema ⋮ Degrees of Infinite Words, Polynomials and Atoms

Cites Work

• Ordering sequences by permutation transducers
• Classical recursion theory. Vol. II
• Operations preserving regular languages
• Degrees of Infinite Words, Polynomials and Atoms
• Degrees of Transducibility
• The Degree of Squares is an Atom
• Some Algebraic Properties of Machine Poset of Infinite Words
• Degrees of finite-state transformability
• Automatic Sequences
• On periodically iterated morphisms
• Degrees of Infinite Words, Polynomials and Atoms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degrees of Infinite Words, Polynomials and Atoms