Finitely generated \(\omega\)-languages

DOI10.1016/0020-0190(86)90131-6zbMath0627.68059OpenAlexW2020492103MaRDI QIDQ1092671

E. Timmerman, Michel Latteux

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90131-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

On generators of rational \(\omega\)-power languages ⋮ Rebootable and suffix-closed $\omega $-power languages ⋮ Finitely generated bi\(\omega\)-languages ⋮ Completing circular codes in regular submonoids ⋮ Completing prefix codes in submonoids. ⋮ Prefix-free languages as \(\omega\)-generators

Cites Work

• Adherences of languages
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finitely generated \(\omega\)-languages