Degrees of Infinite Words, Polynomials and Atoms

DOI10.1007/978-3-662-53132-7_14zbMath1436.68170OpenAlexW2481697722MaRDI QIDQ2817385

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

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25194

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (7)

Transducer degrees: atoms, infima and suprema ⋮ Braids via term rewriting ⋮ Decreasing diagrams with two labels are complete for confluence of countable systems ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Unnamed Item ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Finite transducers and rational transductions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lazy productivity via termination
• 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

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