Tree automata, mu-calculus and determinacy
Top Cited Papers
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 368-377
- https://doi.org/10.1109/sfcs.1991.185392
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- On the power of randomization in on-line algorithmsAlgorithmica, 1994
- The complexity of tree automata and logics of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- Alternating automata on infinite objects, determinacy and Rabin's theoremLecture Notes in Computer Science, 1985
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- AlternationJournal of the ACM, 1981
- Borel DeterminacyAnnals of Mathematics, 1975
- The emptiness problem for automata on infinite treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- The strict determinateness of certain infinite gamePacific Journal of Mathematics, 1955