Theoretical Computer Science
Alternating automata on infinite trees
Theoretical Computer Science
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 Finite Graph Problem for Two-Way Alternating Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
On finite satisfiability of the guarded fragment with equivalence or transitive guards
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the finite satisfiability problem for the guarded fragment with transitivity
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Finite satisfiability for guarded fixpoint logic
Information Processing Letters
| Hi-index | 0.00 |
A graph extension oft wo-way alternating automata on trees is considered. The following problem: "does a given automaton accept any finite graph?" is proven EXPTIME complete. Using this result, the decidability ofthe finite model problem for the modal 碌-calculus with backward modalities is shown.