A classification of \(\omega\)-regular languages

DOI10.1016/0304-3975(85)90043-XzbMath0565.68076MaRDI QIDQ1058863

Michael Kaminski

Publication date: 1985

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

zbMATH Keywords

finite automataomega-regular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

On omega context free languages which are Borel sets of infinite rank. ⋮ A branching time logic with past operators ⋮ Chain automata ⋮ The Wadge-Wagner hierarchy of ω-rational sets ⋮ Borel hierarchy and omega context free languages. ⋮ On the separation question for tree languages ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ Various hierarchies of \(\omega\)-regular sets ⋮ TYPENESS FOR ω-REGULAR AUTOMATA ⋮ THE WAGNER HIERARCHY

Cites Work

• Unnamed Item
• Unnamed Item
• A note on \(\omega\)-regular languages
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Sets of Numbers Defined by Finite Automata
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: A classification of \(\omega\)-regular languages