scientific article; zbMATH DE number 4051592
zbMATH Open0645.03037MaRDI QIDQ3787993FDOQ3787993
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
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
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)
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating automata with start formulas
- Fundamentals of Computation Theory
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Title not available (Why is that?)
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
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)