The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction

DOI10.1016/0304-3975(90)90018-DzbMath0704.68069MaRDI QIDQ917321

E. Timmerman

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Büchi automaton\(\omega \) -languagesdeterministic Müller automatarational transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Literal shuffle on \(\omega\)-languages ⋮ Characterizations of rational \(\omega\)-languages by means of right congruences ⋮ Minimal generators of submonoids of $A^\infty $

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations rationnelles infinitaires
• A note on \(\omega\)-regular languages
• Codeterministic automata on infinite words
• Adherences of languages
• A note on morphic characterization of languages
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• Two characterizations of rational adherences
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• Sequential mappings of $\omega $-languages
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton