Some Algebraic Properties of Machine Poset of Infinite Words
From MaRDI portal
Publication:3526411
DOI10.1051/ita:2008009zbMath1167.68030OpenAlexW1963878263MaRDI QIDQ3526411
Publication date: 25 September 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92881
Combinatorics on words (68R15) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, etc. in computability and recursion theory (03D40)
Related Items
Degrees of Transducibility, Transducer degrees: atoms, infima and suprema, Degrees of Infinite Words, Polynomials and Atoms, On the Complexity of Infinite Advice Strings, Equivalence of right infinite words, Modularity in the semilattice of \(\omega \)-words, Degrees of Infinite Words, Polynomials and Atoms
Cites Work
- The recursively enumerable degrees are dense
- On ω-regular sets
- Uniqueness Theorems for Periodic Functions
- Testing and generating infinite sequences by a finite automaton
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item