Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)

@inproceedings{Emerson1991TreeAM,
  title={Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)},
  author={E. Allen Emerson and Charanjit S. Jutla},
  booktitle={FOCS},
  year={1991}
}
Highly Influential
This paper has highly influenced 26 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
279 Extracted Citations
5 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 279 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-5 of 5 references

Complexity of Tree Automata and Modal logics of Programs ” On Simultak neously Determinizing and Complementing w - Automata ”

  • L. Harrington Y. Gurevich
  • 1982

Buchi , ‘ ‘ Using Determinacy to eliminate quantifiers ” , Fundamentals of Computation The - [ Bug 31 J . R . Buchi , “ State - Strategies for Games in FC 6 n G 6 a ”

  • R. Karp, G. Tardos, A. Wigderson

Similar Papers

Loading similar papers…