The finite graph problem for two-way alternating automata

Authors:
Mikolaj Bojańczyk
Affiliations:
Uniwersytet Warszawski, Wydzial MIM, Banacha 2, Warszawa, Poland
Venue:
Theoretical Computer Science - Foundations of software science and computation structures
Year:
2003

Citing 7
Cited 0

Alternating tree automata

Theoretical Computer Science
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Trees, automata, and games

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A temporal logic for reasoning about partially ordered computations (Extended Abstract)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two-way alternating automata on infinite trees were introduced by Vardi (Reasoning about the part with two way automata, Lecture Notes in Computer Science, vol. 11, Springer, Berlin, 1998, pp. 628-641). Here we consider alternating two-way automata on graphs and show the decidability of the following problem: "does a given automaton with the Büchi condition accept any finite graph?" Using this result we demonstrate the decidability of the finite model problem for a certain fragment of the modal µ-calculus with backward modalities.