Progress measures, immediate determinacy, and a subset construction for tree automata
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 13 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
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- Trees, automata, and gamesPublished by Association for Computing Machinery (ACM) ,1982
- Using determinancy of games to eliminate quantifiersLecture Notes in Computer Science, 1977
- Borel DeterminacyAnnals of Mathematics, 1975
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959