A normal form for Church-Rosser language systems

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

Volumn 2051 LNCS, Issue , 2001, Pages 322-337

  Woinowski, Jens R ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS;

CHURCH-ROSSER LANGUAGES; NORMAL FORM; REWRITING RULES;

RELIGIOUS BUILDINGS;

EID: 0038687311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_24     Document Type: Conference Paper

References (14)

1. M. Beaudry, M. Holzer, G. Niemann, and F. Otto. MacNaughton languages. Technical Report Mathematische Schriften Kassel, No. 26/00, Universität Kassel, November 2000.
2. R. V. Book and C. O'Dunlaing. Testing for the Church-Rosser property. Theoretical Computer Science, 16:223-229, 1981.
3. G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141:1-36, 1998.
4. R.V. Book. Confluent and other types of Thue systems. JACM, 29:171-182, 1982.
5. G. Buntrock. Wachsende kontext-sensitive Sprachem. Habilitationss-chrift, Fakultät für Mathematik und Informatik, Universität Würzburg, Juli 1996.
6. N. Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.
7. E. Dahlhaus and M.K. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33:456-472, 1986.
8. M. Jantzen. Confluent String Rewriting. Springer-Verlag, 1988.
9. R. McNaughton. An insertion into the Chomsky hierarchy? In J. Karhumaki, H. A. Maurer, G. Paǔn, and G. Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honour of Arto Salomaa, pages 204-212. Springer-Verlag, 1999.
10. R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal Association Computing Machinery, 35:324344, 1988.
11. G. Niemann and F. Otto. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In M. Nivat, editor, Foundations of Software Sscience and Computation Structures, Proceedings FoSSaCS'98, volume 1378 of LNCS, pages 243-257, Berlin, 1998. Springer-Verlag.
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, volume 1232 of LNCS, pages 5367, Berlin, 1997. Springer-Verlag.
13. J. R. Woinowski. A normal form for Church-Rosser language systems. Report, TU-Darmstadt,www.iti.informatik.tu-darmstadt.de/~woinowsk/, June 2000.
14. J. R. Woinowski. Prefix languages of Church-Rosser languages. In Proceedings of FST-TCS 2000 (Foundations of Software Technology/Theoretical Computer Science), Lecture Notes in Computer Science. Springer-Verlag, 2000.