A generalization of the Büchi-Elgot-Trakhtenbrot theorem

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

Volumn 2142, Issue , 2001, Pages 355-368

  Galota, Matthias ^a   Vollmer, Heribert ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

ACCEPTANCE CRITERIA; EXPRESSIVE POWER; GENERALIZED QUANTIFIERS; LOGIC CAPTURES; MONADIC SECOND-ORDER LOGIC; NONDETERMINISTIC FINITE AUTOMATON; SECOND ORDERS; WORD PROBLEM;

FORMAL LOGIC;

EID: 84944182998     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44802-0_25     Document Type: Article

References (15)

1. J. R. Büchi and C. C. Elgot. Decision problems of weak second order arithmetics and finite automata, Part I. Notices of the American Mathematical Society, 5:834, 1958.
2. D. A. Mix Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274-306, 1990.
3. F. Bédard, F. Lemieux, and P. McKenzie. Extensions to Barrington’s Mprogram model. Theoretical Computer Science, 107:31-61, 1993.
4. J. R. Büchi. On a decision method in restricted second-order arithmetic. In Proceedings Logic, Methodology and Philosophy of Sciences 1960, Stanford, CA, 1962. Stanford University Press.
5. H.-J. Burtschick and H. Vollmer. Lindström quantifiers and leaf language definability. International Journal of Foundations of Computer Science, 9:277-294, 1998.
6. S. A. Cook. Characterizations of pushdown machines in terms of timebounded computers. Journal of the Association for Computing Machinery, 18:4-18, 1971.
7. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer Verlag, Berlin Heidelberg, 1995.
8. P. Lindström. First order predicate logic with generalized quantifiers. Theoria, 32:186-195, 1966.
9. C. Lautemann, P. McKenzie, T. Schwentick, and H. Vollmer. The descriptive complexity approach to LOGCFL. Journal of Computer and Systems Sciences, 2001. To appear. A preliminary version appeared in the Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science Vol. 1563, pp. 444-454, Springer Verlag, 1999.
10. R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971.
11. T. Peichl and H. Vollmer. Finite automata with generalized acceptance criteria. Discrete Mathematics and Theoretical Computer Science, 2001. To appear. A preliminary version appeared in the Proceedings of the 26th International Colloqium on Automata, Languages, and Programming, Lecture Notes in Computer Science Vol. 1644, pp. 605-614, Springer Verlag, 1999.
12. H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, 1994.
13. I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25:405-414, 1978.
14. W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and Systems Sciences, 25:360-376, 1982.
15. B. A. Trakhtenbrot. Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR, 140:326-329, 1961. In Russian.