A logical characterisation of linear time on nondeterministic turing machines

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

Volumn 1563, Issue , 1999, Pages 143-152

  Lautemann, Clemens ^a   Schweikardt, Nicole ^a   Schwentick, Thomas ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINERY;

DECREASING FUNCTIONS; EHRENFEUCHT GAME; LINEAR TIME; UNARY FUNCTIONS; UNARY RELATIONS;

TURING MACHINES;

EID: 0038675744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_13     Document Type: Conference Paper

References (17)

1. M. Ajtai and R. Fagin. Reachability is harder for directed than for undirected finite graphs. Journal of Symbolic Logic, 55(1):113-150, 1990.
2. J. Autebert, J. Berstel, and L. Boasson. Context-free languages and pushdown automata. Handbook of Formal Languages, 2:111-174, 1997.
3. R. Book and S. Greibach. Quasi-realtime languages. Math. Syst. Theory, 4:97-111, 1970.
4. J.R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6:66-92, 1960.
5. H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, New York, 1995.
6. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R.M. Karp, editor, Complexity of Computation, volume 7 of SIAM-Proceedings, pages 43-73. AMS, 1974.
7. E. Grädel. Capturing complexity classes by fragments of second order logic. Theoretical Computer Science, 101:35-57, 1992.
8. E. Grandjean. Invariance properties of RAMs and linear time. Computational Complexity, 4:62-106, 1994.
9. E. Grandjean. Linear time algorithms and NP-complete problems. SIAM Journal of Computing, 23:573-597, 1994.
10. E. Grandjean. Sorting, linear time and the satisfiability problem. Annals of Mathematics and Artificial Intelligence, 16:183-236, 1996.
11. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979.
12. N. Immerman. Descriptive and Computational Complexity. Springer-Verlag, New York, 1998.
13. C. Lautemann, T. Schwentick, and D. Thérien. Logics for context-free languages. In Proceedings of the Annual Conference of the EACSL, volume 933 of Lecture Notes in Computer Science, pages 205-216, 1994.
14. J. F. Lynch. The quantifier structure of sentences that characterize nondeterministic time complexity. Computational Complexity, 2:40-66, 1992.
15. W. Maass, G. Schnitger, E. Szemerédi, and G. Turán. Two tapes versus one for off-line turing machines. Computational Complexity, 3:392-401, 1993.
16. W. Paul, N. Pippenger, E. Szemerédi, and W. Trotter. On determinism versus nondeterminism and related problems. In Proc. 24th Ann. Symp. Found. Comput. Sci., pages 429-438, 1983.
17. T. Schwentick. Padding and the expressive power of existential second-order logics. In 11th Annual Conference of the EACSL, CSL '97, pages 461-477, 1997.