Skip to main content
Conference ProceedingsOPEN ACCESS

The finite graph problem for two-way alternating automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2030 88-103
DOI: 10.1007/3-540-45315-6_6
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Bojańczyk, M. (2001). The finite graph problem for two-way alternating automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2030, pp. 88–103). Springer Verlag. https://doi.org/10.1007/3-540-45315-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free