On representing recursively enumerable languages by internal contextual languages

Theoretical Computer Science

Volumn 205, Issue 1-2, 1998, Pages 61-83

  Ehrenfeucht, Andrzej ^a   Pǎun, Gheorghe ^b   Rozenberg, Grzegorz ^a,c  

^a University of Colorado at Boulder   (United States)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346457630     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00035-2     Document Type: Article

References (25)

1. B.S. Baker, R.V. Book, Reversal-bounded multipushdown machines, J. Comput. System Sci. 8 (1974) 315-332.
2. F.J. Brandenburg, Cancellations in linear context-free languages, Univ. Passau, Fakultät für Math. und Informatik, Report MIP-8904, 1989.
3. F.J. Brandenburg, On context-free grammars with regular control sets, 7th Conf. on Automata and Formal Languages, Salgotarjan, 1993.
4. J. Dassow, Gh. Pǎun, Regulated Rewriting in Formal Language Theory, Springer, Berlin, Heidelberg, 1989.
5. A. Ehrenfeucht, Gh. Pǎun, G. Rozenberg, The linear landscape of external contextual languages, Acta Inform. 33 (1996) 571-593.
6. J. Gonczarowski, M.K. Warmuth, Scattered versus context-sensitive rewriting, Acta Inform. 27 (1989) 81-95.
7. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
8. S. Istrail, Contextual grammars with regulated selection, Stud. Cercet. Mat. 30 (1978) 287-294.
9. M. Latteux, B. Leguy, B. Ratoandromanana, The family of one-counter languages is closed under quotient, Acta Inform. 22 (1985) 579-588.
10. M. Latteux, P. Turakainen, A characterization of recursively enumerable languages, Acta Inform. 28 (1990) 179-186.
11. S. Marcus, Algebraic Linguistics. Analytical Models, Academic Press, New York, 1967.
12. S. Marcus, Contextual grammars, Rev. Roum. Math. Pures Appl. 14 (1969) 1525-1534.
13. H.A. Maurer, A. Salomaa, D. Wood, Pure grammars, Inform. and Control 42 (1979) 103-141.
14. Gh. Pǎun, Contextual Grammars, The Publ. House of the Romanian Academy of Sciences, Bucureşti, 1982 (in Romanian).
15. Gh. Pǎun, A characterization of recursively enumerable languages, Bull. EATCS 45 (1991) 218-222.
16. Gh. Pǎun, Marcus contextual grammars. After 25 years, Bull. EATCS 52 (1994) 263-273.
17. Gh. Pǎun, X.M. Nguyen, On the inner contextual grammars, Rev. Roum. Math. Pures Appl. 25 (1980) 641-651.
18. Gh. Pǎun, G. Rozenberg, A. Salomaa, Contextual grammars: erasing, determinism, one-sided contexts, in: G. Rozenberg, A. Salomaa (Eds.), Developments in Language Theory, World Scientific, Singapore, 1994, pp. 370-388.
19. Gh. Pǎun, G. Rozenberg, A. Salomaa, Contextual grammars: parallelism and blocking of derivations, Fund. Inform. 25 (1996), 381-397.
20. Gh. Pǎun, G. Rozenberg, A. Salomaa, Marcus contextual grammars: modularity and leftmost derivation, in: Gh. Pǎun (Ed.), Mathematical Aspects of Natural and Formal Languages, World Scientific, Singapore, 1994, pp. 375-392.
21. D. Rosenkrantz, Programmed grammars and classes of formal languages, J. ACM 16 (1969) 107-131.
22. A. Salomaa, On some families of formal languages obtained by regulated derivations, Ann. Acad. Sci. Fennicae, Ser. A, Math. 179 (1970).
23. A. Salomaa, Formal Languages, Academic Press, New York, 1973.
24. P. Turakainen, On characterization of recursively enumerable languages in terms of linear languages and VW-grammars, Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Ser, A, 81 (1978) 145-153.
25. S. Vicolov, Two theorems about Marcus contextual languages, Bull. Math. Soc. Sci. Math. Roumanie 35 (1991) 167-170.