scientific article; zbMATH DE number 4051592

MaRDI QIDQ3787993zbMATH OpenFDO

Authors Michel Parigot

Publication date 1987

zbMATH Keywords

tree languagemonadic formulasgame theoretic approachhiearchy of automatamonadic second order theory of two successors arithmeticmonadic theory of the infinite binary treeweak monadic formulasworking processes of alternating automata

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Publication:4726235
• scientific article; zbMATH DE number 3983141
• Hierarchies of weak automata and weak monadic formulas
• Publication:4941910
• Alternating Tree Automata and Parity Games

Cited in

(9)

• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• A complete axiomatization of MSO on infinite trees
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• scientific article; zbMATH DE number 3999901 (Why is no real title available?)
• Alternating automata with start formulas
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 1418347 (Why is no real title available?)
• Monoidal-closed categories of tree automata
• scientific article; zbMATH DE number 4008381 (Why is no real title available?)

This page was built for publication:

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