Fixed point characterization of Bu¨chi automata on infinite trees

Authors:
André Arnold;Damian Niwinski
Affiliations:
-;-
Venue:
Journal of Information Processing and Cybernetics
Year:
1991

Citing 0
Cited 3

A New Logical Characterization of Büchi Automata

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Ambiguous classes in µ-calculi hierarchies

Theoretical Computer Science - Foundations of software science and computation structures
π2 ∩ Σ2 ≡ AFMC

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract