Tree Automata, Mu-Calculus and Determinacy¶

Emerson, E. A., & Jutla, C. S. (1991). Tree Automata, Mu-Calculus and Determinacy. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science.

Type: Conference paper
Intellectual base: Primary research
Year: 1991
DOI: 10.1109/sfcs.1991.185392
Link: https://doi.org/10.1109/SFCS.1991.185392

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Determinacy
- Emerson and Jutla use fixed-point characterizations of winning regions to prove determinacy results involved in tree-automata complementation and online-algorithm games.

Verification¶

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b4a5401d3f22 · see in the full table