Alternating automata with start formulas

DOI10.1016/0020-0190(90)90029-WzbMath0702.68085OpenAlexW2075026862MaRDI QIDQ915487

A. Włodzimierz Mostowski

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90029-w

zbMATH Keywords

infinite treesalternating automatapair index

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees ⋮ Monadic second-order logic, graph coverings and unfoldings of transition systems

Cites Work

• Hierarchies of weak automata and weak monadic formulas
• Alternating automata on infinite trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating automata with start formulas