Descriptional complexity of deterministic restarting automata

7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Proceedings

Volumn , Issue , 2005, Pages 158-169

  Holzer, Markus ^a   Kutrib, Martin ^b   Reimann, Jens ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; FINITE AUTOMATA; RECURSIVE FUNCTIONS;

AUTOMATON MODEL; DESCRIPTIONAL COMPLEXITY; LOWER BOUNDS; PUSH-DOWN AUTOMATA; RESTARTING AUTOMATA; UPPER BOUND; WINDOW SIZE;

DISPERSION COMPENSATION;

EID: 33749400684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Bertsch, E. and Nederhof, M.-J. Size/lookahead tradeoff for LL(k)-grammars. Inform. Process. Lett. 80 (2001), 125-129.
2. Buntrock, G. and Otto, F. Growing context-sensitive languages and Church-Rosser languages. Inform. Comput. 141 (1998), 1-36.
3. Goldstine, J., Kappes, M., Kintala, C. M. R., Leung, H., Malcher, A., and Wotschke, D. Descriptional complexity of machines with limited resources. J. UCS 8 (2002), 193-234.
4. Hartmanis, J. Context-free languages and Turing machine computations. Proc. Symposia in Applied Mathematics 19 (1967), 42-51.
5. Hartmanis, J. On the succinctness of different representations of languages. SIAM J. Comput. 9 (1980), 114-120.
6. Hartmanis, J. On Godel speed-up and succinctness of language representations. The- oret. Comput. Sci. 26 (1983), 335-342.
7. Jancar, P., Mraz, F., Platek, M., and Vogel, J. Restarting automata. Fundamentals of Computation Theory (FCT 1995), LNCS 965, 1995, pp. 283-292.
8. Jancar, P., Mraz, F., Platek, M., and Vogel, J. On monotonic automata with a restart operation. J. Autom., Lang. Comb. 4 (1999), 287-311.
9. Kapoutsis, C. From k + 1 to k heads the descriptive trade-off is non-recursive. Descriptional Complexity of Formal Systems (DCFS 2004), 2004, pp. 213-224.
10. Kutrib, M. The phenomenon of non-recursive trade-offs. Descriptional Complexity of Formal Systems (DCFS 2004), 2004, pp. 83-97.
11. Kutrib, M. On the descriptional power of heads, counters, and pebbles. Theoret. Comput. Sci. 330 (2005), 311-324.
12. Leung, H. and Wotschke, D. On the size of parsers and LR(k)-grammars. Theoret. Comput. Sci. 242 (2000), 59-69.
13. Malcher, A. Descriptional complexity of cellular automata and decidability questions. J. Autom., Lang. Comb. 7 (2002), 549-560.
14. Malcher, A. On non-recursive trade-offs between finite-turn pushdown automata. Technical Report 2/04, University of Frankfurt, Germany, 2004.
15. McNaughton, R., Narendran, P., and Otto, F. Church-Rosser Thue systems and formal languages. J. ACM 35 (1988), 324-344.
16. Meyer, A. R. and Fischer, M. J. Economy of description by automata, grammars, and formal systems. Switching and Automata Theory, 1971, pp. 188-191.
17. Mraz, F. Lookahead hierarchies of restarting automata. J. Autom., Lang. Comb. 6 (2001), 493-506.
18. Narendran, P., O'Dunlaing, C., and Rolletschek, H. Complexity of certain decision problems about congruential languages. J. Comput. System Sci. 30 (1985), 343-358.
19. Niemann, G. and Otto, F. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inform. Comput. 197 (2005), 1-21.
20. Otto, F. Restarting automata and their relations to the Chomsky hierarchy. Developments in Language Theory (DLT 2003), LNCS 2710, 2003, pp. 55-74.
21. Schmidt, E. M. and Szymanski, T. G. Succinctness of descriptions of unambiguous context-free languages. SIAM J. Comput. 6 (1977), 547-553.
22. Sunckel, B. On the descriptional complexity of metalinear cd grammar systems. Descriptional Complexity of Formal Systems (DCFS 2004), 2004, pp. 260-273.
23. Valiant, L. G. A note on the succinctness of descriptions of deterministic languages. Inform. Control 32 (1976), 139-145.