Alternating automata with start formulas

DOI10.1016/0020-0190(90)90029-WMaRDI QIDQ915487zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Alternating automata on infinite trees
• Publication:4726235
• scientific article; zbMATH DE number 3983141
• scientific article; zbMATH DE number 4051592
• scientific article; zbMATH DE number 1759492

Cites work

• scientific article; zbMATH DE number 3983141 (Why is no real title available?)
• scientific article; zbMATH DE number 3990873 (Why is no real title available?)
• scientific article; zbMATH DE number 3999901 (Why is no real title available?)
• Alternating automata on infinite trees
• Hierarchies of weak automata and weak monadic formulas

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915487)