Growing Context-Sensitive Languages and Church-Rosser Languages

Information and Computation

Volumn 141, Issue 1, 1998, Pages 1-36

  Buntrock, Gerhard ^a   Otto, Friedrich ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b UNIVERSITY OF KASSEL   (Germany)

Author keywords

Automata and formal languages; Computational complexity; String rewriting

Indexed keywords

EID: 0010183563     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2681     Document Type: Article

References (29)

1. Berstel, J. (1976-1977), Congruences plus que parfaites et langages algébriques. "Seminaire d'Informatique Théorique," Institute de Programmation, pp. 123-147.
2. Buntrock, G., and Loryś, K. (1992), On growing context-sensitive languages, in "Proc. of 19th ICALP" (W. Kuich, Ed.), Lecture Notes in Computer Science, Vol. 623, pp. 77-88, Springer-Verlag, Berlin/New York.
3. Buntrock, G., and Loryś, K. (1994), The variable membership problem: Succinctness versus complexity, in "Proc. of 11th STACS" (P. Enjalbert, E. W. Mayr, and K. W. Wagner, Eds.), Lecture Notes in Computer Science, Vol. 775, pp. 595-606, Springer-Verlag, Berlin/New York.
4. Book, R. V., and Otto, F. (1993), "String-Rewriting Systems," Springer-Verlag, Berlin/ New York.
5. Book, R. V. (February 1969), "Grammers with Time Functions," Dissertation, Harvard University, Cambridge, MA.
6. Book, R. V. (1978), On the complexity of formal grammars, Acta Inform. 9, 171-181.
7. Book, R. V. (1982), Confluent and other types of Thue systems, J. Assoc. Comput. Math. 29, 171-182.
8. Brandenburg, F. J. (1977), On one-way auxiliary pushdown automata, in "Proc. of 3rd GI-Conference on Theoretical Computer Science" (H. Tzschach, H. Waldschmidt and H. K.-G. Walter, Eds.), Lecture Notes in Computer Science, Vol. 48, pp. 132-144, Springer-Verlag, Berlin/New York.
9. Buntrock, G. (November 1993), Growing context-sensitive languages and automata, Preprint-Reihe, Nr. 69, Institut für Informatik, Universität Würzburg.
10. Buntrock, G. (July 1996), Wachsende kontextsensitive Sprachen, Habilitationsschrift, Fakultät für Mathematik und Informatik, Universität Würzburg.
11. Chytil, M. P. (1976), Analysis of the non-context-free component of formal languages, in "Proc. of 5th MFCS" (A. Mazurkiewicz, Ed.), Lecture Notes in Computer Science, Vol. 45, pp. 230-236, Springer-Verlag, Berlin/New York.
12. Chytil, M. P. (1977), Comparison of the active visiting and the crossing complexities, in "Proc. of 6th MFCS" (J. Gruska, Ed.), Lecture Notes in Computer Science, Vol. 53, pp. 272-281, Springer-Verlag, Berlin/New York.
13. Dahlhaus, E., and Warmuth, M. K. (1986), Membership for growing context-sensitive grammars is polynomial, J. Comput. System Sci. 33, 456-472.
14. Ginsburg, S., and Harrison, M. A. (1968), One-way nondeterministic real-time list-storage languages, J. Assoc. Comput. Mach. 15, 428-446.
15. Gladkij, A. W. (1964), Algorithmic nature of invariant properties of context-sensitive grammars, Algebri i Logika 3 (5/6), 17-32. [In Russian]
16. Gladkij, A. W. (1964), On the complexity of derivations for context-sensitive grammars, Algebri i Logika 3, 29-44. [In Russian]
17. Griffiths, Th. (1968), Some remarks on derivations in general rewriting systems, Inform. and Control 12, 27-54.
18. Hartmanis, J., Immerman, N., and Mahaney, S. R. (1978), One-way log-tape reductions, in "Proc. of 19th FOCS," pp. 65-71, IEEE Press, New York.
19. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages, and Computation," Series in Computer Science, Addison-Wesley, Reading, MA.
20. Jančar, P., Mráz, F., and Plátek, M. (1993), A taxonomy of forgetting automata, in "Proc. of 18th MFCS" (A. M. Borzyszkowski and S. Sokolowski, Eds.), Lecture Notes in Computer Science, Vol. 711, pp. 527-536, Springer-Verlag, Berlin/New York.
21. Knuth, D. E. (1968), Semantics of context-free languages, Math. Systems Theory 2, 127-145.
22. Lautemann, C. (1988), One pushdown and a small tape, in "Dirk Siefkes zum 50. Geburtstag" (K. W. Wagner, Ed.), pp. 42-47, Technische Universität Berlin and Universität Augsburg.
23. Loecks, J. (1970), The parsing of general phrase-structure grammars, Inform. and Control 16, 443-464.
24. McNaughton, R., Narendran, P., and Otto, F. (1988), Church-Rosser Thue systems and formal languages, Assoc. Comput. Mach. 35, 324-344.
25. Otto, F., Katsura, M., and Kobayashi, Y. (1997), Cross-sections for finitely presented monoids with decidable word problems, in "Proceedings of 8th RTA" (H. Comon, Ed.), Lecture Notes in Computer Science, Vol. 1232, pp. 53-67, Springer-Verlag, Berlin/New York.
26. Ruzzo, W. L. (1980), Tree-size bounded alternation, J. Comput. System Sci. 21, 218-235.
27. Sudborough, I. H. (1978), On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach. 25, 405-414.
28. Walters, D. A. (1970), Deterministic context-sensitive languages: Part II, Inform. and Control 17, 41-61.
29. Wagner, K. W., and Wechsung, G. (1986), "Computational Complexity," VEB Deutscher Verlag der Wissenschaften and Reidel Verlag, Dordrecht.