Two-way alternating automata and finite models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 833-844

  Bojańczyk, Mikołaj ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING AUTOMATA; FINITE GRAPHS; FINITE MODEL; FOLLOWING PROBLEM;

COMPUTABILITY AND DECIDABILITY; TREES (MATHEMATICS);

AUTOMATA THEORY;

EID: 84869172906     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. Mikołaj Bojańczyk. The finite graph problem for two-way alternating automata. In FOSSACS 2001, volume 2030 of LNCS, pages 88-103, 2001.
2. A. Saoudi D. E. Muller and P. E. Shupp. Weak alternating automata give a simple explanation why most temporal and dynamic logics are decidable in exponential time. In Proceedings 3rd IEEE Symposium on Logic in Computer Science, pages 422-427, 1988.
3. E. A. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32th IEEE Symposium on Foundations of Computer Science, pages 368-377, 1991.
4. E. Grädel. On the restraining power ofguards. Journal of Symbolic Logic, 1999.
5. E. Grädel and I.Walukiewicz. Guarded fixed point logic. In Proceedings 14th IEEE Symp. on Logic in Computer Science, pages 45-54, 1999.
6. Y. Gurevich and L. Harrington. Automata, trees and games. In Proc. 14th. Ann. ACM Symp. on the Theory of Computing, pages 60-65, 1982.
7. J. van Benthem H. Andreka and I. Nemeti. Modal logics and bounded fragments ofpredicate logic. Journal of Philosophical Logic, pages 217-274, 1998.
8. I. Hodkinson. Loosely guarded fragment has finite model property. J. Symbolic Logic, to appear.
9. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
10. R. Ladner M. Fischer. Propositional dynamic logic ofregular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
11. A. Mostowski. Games with forbidden positions. Technical report, University of Gdańsk, 1991.
12. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
13. M. O. Rabin. Decidability ofsecond-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141, 1969.
14. G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41:305-318, 1985.
15. Wolfgang Thomas. Languages, automata, and logic. In Handbook of Formal Language Theory, III, pages 389-455. Springer, 1997.
16. M. Vardi. Reasoning about the past with two-way automata. In vol. 1443 LNCS, pages 628-641, 1998.