Church-Rosser Languages vs. UCFL

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

Volumn 2380 LNCS, Issue , 2002, Pages 147-158

  Jurdziński, Tomasz ^a,b   Loryś, Krzysztof ^b  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE LANGUAGES; POLYNOMIAL APPROXIMATION;

CHURCH-ROSSER LANGUAGES; MEMBERSHIP PROBLEM; POLYNOMIAL-TIME; PUMPING TECHNIQUES;

CONTEXT SENSITIVE LANGUAGES;

EID: 33746224901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_14     Document Type: Conference Paper

References (14)

1. M. Beaudry, M. Holzer, G. Niemann, F. Otto, McNaughton Languages, Mathematische Schriften Kassel 26/00 (conference version: On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy, DLT 2001, LNCS 2295, 340-348).
2. G. Buntrock, Wachsende Kontextsensitive Sprachen, Habilitationsschrift, Würzburg, 1995.
3. G. Buntrock, K. Loryś, On growing context-sensitive languages, Proc. of International Colloquium on Automata, Languages and Programming, 1992, LNCS 623, 77-88.
4. G. Buntrock, K. Loryś, The variable membership problem: Succintness versus complexity, Proc. of STACS, 1994, LNCS 775, Springer-Verlag, 595-606.
5. G. Buntrock, F. Otto, Growing Context-Sensitive Languages and Church-Rosser Languages, Information and Computation 141 (1998), 1-36.
6. E. Dahlhaus, M.K. Warmuth, Membership for growing context-sensitive grammars is polynomial, Journal of Computer Systems Sciences, 33 (1986), 456-472.
7. A. Gladkij, On the complexity of derivations for context-sensitive grammars, Algebri i Logika 3, 1964, 29-44. [In Russian]
8. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, 1978.
9. R. McNaughton, P. Narendran, F. Otto, Church-Rosser Thue systems and formal languages, Journal of the Association Computing Machinery, 35 (1988), 324-344.
10. M. Li, P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag 1993.
11. M. Li, P. Vitanyi, A New Approach to Formal Language Theory by Kolmogorov Complexity, SIAM J. on Comp., 24:2(1995), 398-410.
12. G. Niemann, CRL, CDRL und verkuerzende Zweikellerautomaten., Unpublished note, 1997.
13. G. Niemann, F. Otto, Restarting automata, Church-Rosser languages, and confluent internal contextual languages, Proc. of DLT 99, Aachener Informatik-Berichte 99-5, 49-62.
14. G. Niemann, F. Otto, The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages, FoSSaCC 1998, LNCS 1378, 243-257.