The growing context-sensitive languages are the acyclic context-sensitive languages

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

Volumn 2295 LNCS, Issue , 2002, Pages 197-205

  Niemann, Gundula ^a   Woinowski, Jens R ^b,c  

^a UNIVERSITY OF KASSEL   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^c Software Design & Management AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; EQUIVALENCE CLASSES;

CHAIN RULES; CONTEXT SENSITIVE; CONTEXT-FREE KERNELS;

CONTEXT SENSITIVE LANGUAGES;

EID: 34547584320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_16     Document Type: Conference Paper

References (17)

1. Erik Aarts. Recognition for acyclic context-sensitive grammars is probably polynomial for fixed grammars. In Proceedings of the 14th International Conference on Computational Linguistics, 1992.
2. Martin Beaudry, Markus Holzer, Gundula Niemann, and Friedrich Otto. McNaughton Languages. Mathematische Schriften Kassel 26/00, Universität Kassel, November 2000.
3. Ronald V. Book. Grammars with Time Functions. Phd thesis, Harvard University, Cambridge, Massachusetts, February 1969.
4. Franz-Josef Brandenburg. Zur Verallgemeinerung von Grammatiken durch Kontext. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 73, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, 1974.
5. Gerhard Buntrock. Wachsende kontextsensitive Sprachen. Habilitationsschrift, Fakultät für Mathematik und Informatik, UniversitätWürzburg, July 1996. English title: Growing contextsensitive languages.
6. Gerhard Buntrock and Krzysztof Lorýs. Ongrowing context-sensitive languages. InW.Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages and Programming, number 623 in Lecture Notes in Computer Science, pages 77-88, Berlin/New York, 1992. Springer.
7. Gerhard Buntrock and Krzysztof Lorýs. The variable membership problem: Succinctness versus complexity. In P. Enjalbert, E.W. Mayr, and K.W.Wagner, editors, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, number 775 in Lecture Notes in Computer Science, pages 595-606, Berlin/New York, 1994. Springer.
8. Gerhard Buntrock and Friedrich Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141:1-36, 1998.
9. Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.
10. Elias Dahlhaus and Manfred K.Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33:456-472, 1986.
11. Aleksey Vsevolodovich Gladkij. On the complexity of derivations in context-sensitive grammars. Algebra i Logika, Seminar, 3(5-6):29-44, 1964. In Russian.
12. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Series in Computer Science. Addison-Wesley, Reading, MA, 1979.
13. Robert McNaughton. An insertion into the chomsky hierarchy? In Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, and Grzegorz Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 204-212. Springer, 1999.
14. Robert McNaughton, Paliath Narendran, and Friedrich Otto. Church-Rosser Thue systems and formal languages. Journal of the Association Computing Machinery, 35:324-344, 1988.
15. Rohit J. Parikh. On context-free languages. Journal of the Association Computing Machinery, 13:570-581, 1966.
16. Jens R. Woinowski. A normal form for Church-Rosser language systems (with appendix). Technical Report TI-7/00, Technische Universität Darmstadt, June 2000.
17. Jens R.Woinowski. A normal form for Church-Rosser language systems. In A. Middeldorp, editor, Proceedings of the 12th International Conference on Rewriting Techniques and Applications, number 2051 in Lecture Notes in Computer Science, pages 322-337, Berlin, 2001. Springer.