Restarting automata and their relations to the Chomsky hierarchy

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

Volumn 2710, Issue , 2003, Pages 55-74

  Otto, Friedrich ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

CHOMSKY HIERARCHY; EXPRESSIVE POWER; RESTARTING AUTOMATA;

AUTOMATA THEORY;

EID: 35248836442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45007-6_5     Document Type: Article

References (48)

1. Beaudry, M., Holzer, M., Niemann, G., Otto, F.: McNaughton families of languages. Theor. Comput. Sci. 290 (2003) 1581-1628
2. Book, R.V.: Grammars with Time Functions. PhD dissertation. Harvard University, Cambridge, Massachusetts (1969)
3. Book, R.V., Otto, F.: String-Rewriting Systems. Springer, New York (1993)
4. Buntrock, G.: Wachsende kontext-sensitive Sprachen. Habilitationsschrift, Fakultät für Mathematik und Informatik, Universität Würzburg (1996)
5. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Infor. Comput. 141 (1998) 1-36
6. Chytil, M.P., Plátek, M., Vogel, J.: A note on the Chomsky hierarchy. Bulletin of the EATCS 27 (1985) 23-30
7. Dahlhaus, E., Warmuth, M.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33 (1986) 456-472
8. Ehrenfeucht, A., Pǎun, G., Rozenberg, G.: Contextual grammars and formal languages. In: Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Vol. 2. Springer, Berlin Heidelberg New York (1997) 237-293
9. Ehrenfeucht, A., Pǎun, G., Rozenberg, G.: On representing recursively enumerable languages by internal contextual languages. Theor. Comput. Sci. 205 (1998) 61-83
10. Gladkij, A.W.: On the complexity of derivations for context-sensitive grammars. Algebra i Logika 3 (1964) 29-44 (In Russian)
11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A. (1979)
12. Jančar, P., Mráz, F., Plátek, M.: A taxonomy of forgetting automata. In: Borzyszkowski, A.M., Sokolowski, St. (eds.): MFCS'93, Proc., LNCS 711, Springer, Berlin (1993) 527-536
13. Jančar, P., Mráz, F., Plátek, M.: Forgetting automata and context-free languages. Acta Infor. 33 (1996) 409-420
14. Jančar, P., Mráz, F., Plátek, M., Procházka, M., Vogel, J.: Restarting automata, Marcus grammars and context-free languages. In: Dassow, J. Rozenberg, G. and Salomaa, A. (eds.): DLT II, Proc., World Scientific, Singapore (1996) 102-111
15. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.): FCT'95, Proc., LNCS 965, Springer, Berlin (1995) 283-292
16. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On restarting automata with rewriting. In: Pǎun, G., Salomaa, A. (eds.): New Trends in Formal Languages, LNCS 1218, Springer, Berlin (1997) 119-136
17. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Monotonic rewriting automata with a restart operation. In: Plášil, F., Jeffery, K.G. (eds.): SOFSEM'97, Proc., LNCS 1338, Springer, Berlin (1997) 505-512
18. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Different types of monotonicity for restarting automata. In: Arvind, V., Ramanujam, R. (eds.): FSTTCS'98, Proc., LNCS 1530, Springer, Berlin (1998) 343-354
19. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On monotonic automata with a restart operation. J. Autom. Lang. and Comb. 4 (1999) 287-311
20. Jurdziński, T., Loryś, K.: Church-Rosser languages vs. UCFL. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.): ICALP'02, Proc., LNCS 2380, Springer, Berlin (2002) 147-158
21. Jurdziński, T., Loryś, K., Niemann, G., Otto, F.: Some results on RRW-and RRWW-automata and their relationship to the class of growing context-sensitive languages. Mathematische Schriften Kassel, no. 14/01, Fachbereich Mathematik/Informatik, Universität Kassel (2001)
22. Marcus, S.: Contextual grammars and natural languages. In: Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Vol. 2. Springer, Berlin Heidelberg New York (1997) 215-235
23. McNaughton, R.: An insertion into the Chomsky hierarchy? In: Karhumäki, J., Maurer, H., Pǎun, G., Rozenberg, G. (eds.): Jewels are Forever. Springer, Berlin Heidelberg New York (1999) 204-212
24. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. Assoc. Comput. Mach. 35 (1988) 324-344
25. Mráz, F.: Forgetting and Restarting Automata. PhD thesis, Charles University, Prague (2001)
26. Mráz, F.: Lookahead hierarchies of restarting automata. J. Autom. Lang. and Comb. 6 (2001) 493-506
27. Mráz, F., Otto, F.: Hierarchies of weakly monotone restarting automata. In preparation.
28. Mráz, F., Plátek, M., Procházka, M.: Restarting automata, deleting, and Marcus grammars. In: Martín-Vide, C., Pǎun, G. (eds.): Recent Topics in Mathem. and Comput. Linguistics. Editura Academiei Române, Bukarest (2000) 218-233
29. Narendran, P.: Church-Rosser and related Thue systems. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York (1984)
30. Niemann, G.: Regular Languages and Church-Rosser congruential languages. In: Freund, R., Kelemenová, A. (eds.): Grammar Systems 2000, Proc., Silesian University, Opava (2000) 359-370
31. Niemann, G.: Church-Rosser languages and related classes. Dissertation, Universität Kassel (2002)
32. Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In: Nivat, M. (ed.): FoSSaCS'98, Proc., LNCS 1378, Springer, Berlin (1998) 243-257
33. Niemann, G., Otto, F.: Confluent internal contextual languages. In: Martin-Vide, C., Pǎun, G. (eds.): Recent Topics in Mathematical and Computational Linguistics. The Publishing House of the Romanian Academy, Bucharest (2000) 234-244
34. Niemann, G., Otto, F.: Restarting automata, Church-Rosser languages, and representations of r.e. languages. In: Rozenberg, G., Thomas, W. (eds.): DLT'99, Proc., World Scientific, Singapore (2000) 103-114
35. Niemann, G., Otto, F.: On the power of RRWW-automata. In: Ito, M., Pǎun, G., Yu, S. (eds.): Words, Semigroups, and Transductions. World Scientific, Singapore (2001) 341-355
36. Niemann, G., Otto, F.: Further results on restarting automata. In: Ito, M., Imaoka, T. (eds.): Words, Languages and Combinatorics III, Proc., World Scientific, Singapore (2003), to appear
37. Niemann, G., Waldmann, J.: Some regular languages that are Church-Rosser congruential. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.): DLT'01, Proc., LNCS 2295, Springer, Berlin (2002) 330-339
38. Niemann, G., Woinowski, J.R.: The growing context-sensitive languages are the acyclic context-sensitive languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.): DLT'01, Proc., LNCS 2295, Springer, Berlin (2002) 197-205
39. Otto, F., Katsura, M., Kobayashi, Y.: Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. J. Symbol. Comput. 26 (1998) 621-648
40. Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13 (1966) 570-581
41. Plátek, M.: Two-way restarting automata and j-monotonicity. In: Pacholski, L., Ružička, P. (eds.): SOFSEM'01, Proc., LNCS 2234, Springer, Berlin (2001) 316-325
42. Plátek, M., Mráz, F.: Degrees of (non)monotonicity of RWW-automata. In: Dassow, J., Wotschke, D. (eds.): Preproceedings of the 3rd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures. Report No. 16, Fakultät für Informatik, Universität Magdeburg (2001) 159-165
43. Rovan, B.: A framework for studying grammars. In: Gruska, I., Chytil, M. (eds.): MFCS'81, Proc., LNCS 118, Springer, Berlin (1981) 473-482
44. Solms, S.H. von: The characterization by automata of certain classes of languages in the context sensitive area. Infor. Control 27 (1975) 262-271
45. Straňáková, M.: Selected types of pg-ambiguity. The Prague Bulletin of Mathematical Linguistics 72 (1999) 29-57
46. Straňáková, M.: Selected types of pg-ambiguity: Processing based on analysis by reduction. In: Sojka, P., Kopeček, I., Pala, K. (eds.): Text, Speech and Dialogue, 3rd Int. Workshop, TSD 2000, Proc., LNCS 1902, Springer, Berlin (2000) 139-144
47. Woinowski, J.: A normal form for Church-Rosser language systems. In: Middeldorp, A. (ed.): RTA'01, Proc., LNCS 2051, Springer, Berlin (2001) 322-337
48. Woinowski, J.: Church-Rosser languages and their application to parsing problems. Dissertation, Technische Universität Darmstadt (2001)