TYPENESS FOR ω-REGULAR AUTOMATA

DOI10.1142/S0129054106004157zbMath1098.68073MaRDI QIDQ5484907

Gila Morgenstern, Orna Kupferman, Aniello Murano

Publication date: 21 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

automata on infinite wordsacceptance conditions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Automata Theory and Model Checking ⋮ Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Certifying inexpressibility ⋮ The Quest for a Tight Translation of Büchi to co-Büchi Automata ⋮ Cycle detection in computation tree logic ⋮ How Deterministic are Good-For-Games Automata?

Cites Work

• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• A classification of \(\omega\)-regular languages
• Reasoning about infinite computations
• On syntactic congruences for \(\omega\)-languages
• From linear time to branching time
• An automata-theoretic approach to branching-time model checking
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: TYPENESS FOR ω-REGULAR AUTOMATA