Alternating automata and logics over in finite words (extended abstract)

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

Volumn 1872 LNCS, Issue , 2000, Pages 521-535

  Loding, Christof ^a   Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; FORMAL LOGIC;

ALTERNATING AUTOMATA; COMPLEMENTATION; EXTENDED ABSTRACTS; INFINITE STRINGS; LOGICAL PROPERTIES; MONADIC SECOND-ORDER LOGIC; STANDARD FRAMEWORKS; TRANSITION STRUCTURES; INFINITE WORD;

AUTOMATA THEORY;

EID: 84879074587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_36     Document Type: Conference Paper

References (14)

1. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method and Philos. Sci. 1960, pages 1-11, 1962.
2. E.A. Emerson. Temporal and modal logic. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publishers, 1990.
3. N. Klarlund. Progress measures for complementation of !-automata with applications to temporal logic. In Proc. 32nd FOCS, pages 358-367, 1991.
4. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proc. 5th Israeli Symposium on Theory of Computing and Systems, pages 147-158. IEEE Computer Society Press, 1997.
5. L.H. Landweber. Decision poblems for !-automata. Math. System Theory, 3:376-384, 1969.
6. C. Löding. Methods for the transformation of !-automata: Complexity and connection to second order logic. Master's thesis, Christian-Albrechts- University of Kiel, 1998.
7. S. Miyano and T. Hayashi. Alternating nite automata on !-words. Theoretical Computer Science, 32:321-330, 1984.
8. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, 1992.
9. D.E. Muller and P.E. Schupp. Alternating automata on innite trees. Theoretical Computer Science, 54:267-276, 1987.
10. D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th ICALP, LNCS 226, pages 275-283, 1986.
11. S. Rohde. Alternating automata and the temporal logic of ordinals. PhD thesis, University of Illinois at Urbana-Champaign, 1997.
12. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 385-455. Springer-Verlag, 1997.
13. W. Thomas. Complementation of Büchi automata revisited. In J. Karhumäki et al., editor, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 109-122. Springer, 1999.
14. M.Y. Vardi. Alternating automata: Unifying truth and validity checking for temporal logics. In 14th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 1249, pages 191-206, 1997.