The Finite Graph Problem for Two-Way Alternating Automata

Authors:
Mikolaj Bojanczyk
Affiliations:
-
Venue:
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Year:
2001

Citing 7
Cited 1

Alternating automata on infinite trees

Theoretical Computer Science
An automata theoretic decision procedure for the propositional mu-calculus

Information and Computation
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Languages, automata, and logic

Handbook of formal languages, vol. 3
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Glory of the Past

Proceedings of the Conference on Logic of Programs
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Two-Way Alternating Automata and Finite Models

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two-way alternating automata on trees were introduced by Vardi [Va98]. 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.