On alternating \(\omega\)-automata

DOI10.1016/0022-0000(88)90018-9zbMath0655.68070OpenAlexW2012182995MaRDI QIDQ1109572

Peter A. Lindsay

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(88)90018-9

zbMATH Keywords

\(\omega\)-regular languagesalternating \(\omega\)-automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Alternation and \(\omega\)-type Turing acceptors, Alternating automata on infinite trees, Alternating automata, the weak monadic theory of trees and its complexity, Unnamed Item, On the Way to Alternating Weak Automata

Cites Work

• Alternating finite automata on \(\omega\)-words
• Alternation and \(\omega\)-type Turing acceptors
• On ω-regular sets
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item