Language-theoretical representations of \(\omega\)-languages

DOI10.1016/0304-3975(89)90152-7zbMath0677.68087OpenAlexW2086609921MaRDI QIDQ1123638

Hideki Yamasaki

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90152-7

zbMATH Keywords

finite automata\(\omega\)-languagesprefix-free finite languagesprefix-free regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Prefix-free languages as \(\omega\)-generators ⋮ Finite acceptance of infinite words

Cites Work

• Unnamed Item
• Unnamed Item
• A note on \(\omega\)-regular languages
• Variétés d'automates descendants d'arbres infinis
• Accepting conditions for automata on \(\omega\)-languages
• On ω-regular sets
• Decision problems forω-automata

This page was built for publication: Language-theoretical representations of \(\omega\)-languages