An infinite automaton characterization of double exponential time

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

Volumn 5213 LNCS, Issue , 2008, Pages 33-48

  La Torre, Salvatore ^a   Madhusudan, P ^b   Parlato, Gennaro ^a,b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CONTEXT SENSITIVE LANGUAGES; CRYSTAL LATTICES; ROBOTS; TECHNICAL PRESENTATIONS; TRANSLATION (LANGUAGES);

COMPLEXITY CLASSES; EXPONENTIAL TIMES; FINAL STATES; INFINITE NUMBERS; ON TIMES; STIRLING;

AUTOMATA THEORY;

EID: 57849104025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-45     Document Type: Conference Paper

References (23)

1. Alur, R., Madhusudan, P.: Visibly pushdown, languages. In: STOC, pp. 202-211 (2004)
2. Ball, T., Rajamani, S.K.: Bebop: A symbolic model checker for boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 113-130. Springer, Heidelberg (2000)
3. Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 372-386. Springer, Heidelberg (2004)
4. Carayol, A., Wöhrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, RK, Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112-123. Springer, Heidelberg (2003)
5. Carayol, A., Meyer, A.: Context-sensitive languages, rational graphs and determinism.. Logical Methods in Computer Science 2(2) (2006)
6. Carayol, A., Meyer, A.: Linearly bounded infinite graphs. Acta Inf. 43(4), 265-292 (2006)
7. Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194-205. Springer, Heidelberg (1996)
8. Caucal, D., Knapik, T.: A Chomsky-like hierarchy of infinite graphs. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 177-187. Springer, Heidelberg (2002)
9. Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114-133 (1981)
10. Ebbinghaus, H.-D., Plum, J.: Finite Model Theory. Springer, Heidelberg (1995)
11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
12. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161-170. IEEE Computer Society, Los Alamitos (2007)
13. La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of queue systems. In: Ramakrishnan, CR., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299-314. Springer, Heidelberg (2008)
14. Meyer, A.: Traces of term-automatic graphs. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 489-500. Springer, Heidelberg (2007)
15. Morvan, C., Stirling, C.: Rational graphs trace context-sensitive languages. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 548-559. Springer, Heidelberg (2001)
16. Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci. 37, 51-75 (1985)
17. Post, E.L.: Formal reductions of the general combinatorial decision problem. American Journal of Mathematics 65(2), 197-215 (1943)
18. Rispal, C.: The synchronized graphs trace the context-sensitive languages. Electr. Notes Theor. Comput. Sci. 68(6) (2002)
19. Slutzki, G.: Alternating Tree Automata. Theor. Comput. Sci. 41, 305-318 (1985)
20. Thomas, W.: Languages, automata, and logic. Handbook of formal languages 3, 389-455 (1997)
21. Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 130-144. Springer, Heidelberg (2002)
22. Thue, A.: Probleme über Veränderungen von zeichenreihen nach gegebener regeln. Kra. Vidensk. Selsk. Skrifter. 1. Mat. Nat. Kl. 10 (1914)
23. Vardi, M.: Reasoning about The Past with Two-Way Automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628-641. Springer, Heidelberg (1998)