Accepting conditions for automata on \(\omega\)-languages

DOI10.1016/0304-3975(88)90121-1zbMath0665.68063OpenAlexW2002992825WikidataQ61687820 ScholiaQ61687820MaRDI QIDQ1116351

Tetsuo Moriya, Hideki Yamasaki

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90121-1

zbMATH Keywords

finite automataacceptanceregular \(\omega\)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Language-theoretical representations of \(\omega\)-languages ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Literal shuffle on \(\omega\)-languages ⋮ Finite acceptance of infinite words

Cites Work

• Unnamed Item
• Unnamed Item
• A note on \(\omega\)-regular languages
• On ω-regular sets
• Decision problems forω-automata

This page was built for publication: Accepting conditions for automata on \(\omega\)-languages