On generators of rational \(\omega\)-power languages

DOI10.1016/0304-3975(87)90063-6zbMath0632.68080OpenAlexW1975206715MaRDI QIDQ1095674

E. Timmerman, Igor Litovsky

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90063-6

zbMATH Keywords

generators\(\omega \)-powerrational omega-languageregular \(\omega \)- language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

On codes, \(\omega\)-codes and \(\omega\)-generators ⋮ Rebootable and suffix-closed $\omega $-power languages ⋮ Finitely generated bi\(\omega\)-languages ⋮ Completing circular codes in regular submonoids ⋮ Minimal generators of submonoids of $A^\infty $ ⋮ Prefix-free languages as \(\omega\)-generators ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS ⋮ One-relation languages and code generators

Cites Work

• A syntactic congruence for rational \(\omega\)-languages
• Finitely generated \(\omega\)-languages
• Adherences of languages
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On generators of rational \(\omega\)-power languages