When Church-rosser becomes context free

International Journal of Foundations of Computer Science

Volumn 18, Issue 6, 2007, Pages 1293-1302

  Kutrib, Martin ^a   Malcher, Andreas ^b  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Arithmetic hierarchy; Church Rosser languages; Context free languages; Strongly context free languages

Indexed keywords

EID: 35649021354     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054107005339     Document Type: Article

References (13)

1. Buntrock, G. and Otto, F. Growing context-sensitive languages and Church-Rosser languages. Inform. Comput. 141 (1998), 1-36.
2. Cochet, Y. and Nivat, M. Une généralisation des ensembles de Dyck. Israel J. Math. 9 (1971), 389-395.
3. Hartmanis, J. Context-free languages and Turing machine computations. Proc. Symposia in Applied Mathematics 19 (1967), 42-51.
4. Holzer, M., Kutrib, M., and Reimann, J. Descriptional complexity of deterministic restarting automata. Descriptional Complexity of Formal Systems (DCFS 2005), Rapporto Tecnico 06-05, 2005, pp. 158-169.
5. Holzer, M., Kutrib, M., and Reimann, J. Non-recursive trade-offs for deterministic restarting automata. J. Autom., Lang. Comb. (2006), submitted.
6. Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
7. Hie, L., Pǎun, G., Rozenberg, G., and Salomaa, A. On strongly context-free languages. Discrete Appl. Math. 103 (2000), 158-165.
8. Jurdziński, T. and Loryś, K. Church-Rosser languages vs. UCFL. International Colloquium on Automata, Languages and Programming (ICALP 2002), LNCS 2380, 2002, pp. 147-158.
9. McNaughton, R., Narendran, P., and Otto, F. Church-Rosser Thue systems and formal languages. J. ACM 35 (1988), 324-344.
10. Narendran, P., Ó'Dúnlaing, C., and Rolletschek, H. Complexity of certain decision problems about congruential languages. J. Comput. System Sci. 30 (1985), 343-358.
11. Niemann, G. and Otto, F. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inform. Comput. 197 (2005), 1-21.
12. Post, E. L. Recursive unsolvability of a problem of Thue. J. Symbolic Logic 12 (1947), 1-11.
13. Rogers, H. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967.