The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

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

Volumn 1378, Issue , 1998, Pages 243-257

  Niemann, Gundula ^a   Otto, Friedrich ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; RELIGIOUS BUILDINGS;

CHURCH-ROSSER LANGUAGES; PUSH-DOWN AUTOMATA;

CONTEXT SENSITIVE LANGUAGES;

EID: 84947928938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053554     Document Type: Conference Paper

References (12)

1. R.V. Book. Grammars with Time Functions. PhD thesis, Harvard University, Cambridge, Massachusetts, February 1969.
2. R.V. Book. Confluent and other types of Thue systems. J. Association Computing Machinery, 29:171-182, 1982.
3. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.
4. G. Buntrock. Wachsende kontext-sensitive Sprachen. Habilitationsschrift, Fakultät fiir Mathematik und Informatik, Universität Würzburg, July 1996.
5. G. Buntrock and K. Loryś. On growing context-sensitive languages. In W. Kuich, editor, Proc. of 19th ICALP, Lecture Notes in Computer Science 623, pages 77-88. Springer-Verlag, Berlin, 1992.
6. G. Buntrock and K. Loryá. The variable membership problem: Succinctness versus complexity. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, Proc. of 11th STACS, Lecture Notes in Computer Science 775, pages 595-606. Springer-Verlag, Berlin, 1994.
7. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. In E.W. Mayr and C. Puech, editors, Proc. of 12th STACS, Lecture Notes in Computer Science 900, pages 313-324. Springer-Verlag, Berlin, 1995.
8. E. Dahlhaus and M. Warmuth. Membership for growing context-sensitive grammars is polynomial. J. Computer System Sciences, 33:456-472, 1986.
9. A.W. Gladkij. On the complexity of derivations for context-sensitive grammars. Algebri i Logika Sem., 3:29-44, 1964. In Russian.
10. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979.
11. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. J. Association Computing Machinery, 35:324-344, 1988.
12. F. Otto, M. Katsura, and Y. Kobayashi. Cross-sections for finitely presented monoids with decidable word problems. In H. Comon, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 1232, pages 53-67. Springer-Verlag, Berlin, 1997.