Prefix-free languages as \(\omega\)-generators

DOI10.1016/0020-0190(91)90134-4zbMath0714.68049OpenAlexW2002587038MaRDI QIDQ751290

Igor Litovsky

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90134-4

zbMATH Keywords

infinite wordprefix coderegularformal language\(\omega \) - generators

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

On codes, \(\omega\)-codes and \(\omega\)-generators ⋮ Codes générateurs minimaux de langages de mots bi-infinis ⋮ Completing circular codes in regular submonoids ⋮ Completing prefix codes in submonoids. ⋮ One-relation languages and code generators

Cites Work

• Codes and local constraints
• A note on \(\omega\)-regular languages
• Finitely generated \(\omega\)-languages
• On generators of rational \(\omega\)-power languages
• Language-theoretical representations of \(\omega\)-languages
• Adherences of languages
• On infinitary finite length codes
• On ω-regular sets
• Decision problems forω-automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prefix-free languages as \(\omega\)-generators