Progress measures, immediate determinacy, and a subset construction for tree automata
- 31 October 1994
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 69 (2-3) , 243-268
- https://doi.org/10.1016/0168-0072(94)90086-8
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On simultaneously determinizing and complementing omega -automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Rabin measures and their applications to fairness and automata theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- Trees, automata, and gamesPublished by Association for Computing Machinery (ACM) ,1982
- A combinatorial approach to the theory of ω-automataInformation and Control, 1981
- Borel DeterminacyAnnals of Mathematics, 1975
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959