Projection lemmas for \(\omega\)-languages

DOI10.1016/0304-3975(84)90050-1zbMath0545.68074OpenAlexW1987552735WikidataQ125051789 ScholiaQ125051789MaRDI QIDQ797297

Ludwig Staiger

Publication date: 1984

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

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

zbMATH Keywords

projectionacceptancebehavior of automataomega languagesSouslin settopological characterizations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Sequential mappings of $\omega $-languages ⋮ \(X\)-automata on \(\omega\)-words ⋮ Finite acceptance of infinite words

Cites Work

• Decision Problems of Finite Automata Design and Related Arithmetics
• Rekursive Folgenmengen I
• Decision problems forω-automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Projection lemmas for \(\omega\)-languages