On strongly context-free languages

Discrete Applied Mathematics

Volumn 103, Issue 1-3, 2000, Pages 153-165

  Ilie, Lucian ^a   Paun, Gheorghe ^b   Rozenberg, Grzegorz ^c,d   Salomaa, Arto ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c LEIDEN UNIVERSITY   (Netherlands)

^d University of Colorado at Boulder   (United States)

Author keywords

Complementation; Context free language; Descriptional complexity; Slender language

Indexed keywords

EID: 0347304291     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00239-5     Document Type: Article

References (18)

1. Adleman L.M. Molecular computation of solutions to combinatorial problems. Science. 226:1994;1021-1024.
2. Berstel J. Every iterated morphism yields a co-CFL. Inform. Process. Lett. 22(1):1986;7-9.
3. Bucher W., Culik II K., Maurer H.A., Wotschke D. Concise description of finite languages. Theoret. Comput. Sci. 14:1981;227-246.
4. Calude C., Yu S. Language-theoretic complexity of disjunctive sequences. Discrete Appl. Math. 80:1997;203-209.
5. J. Gruska, Descriptional complexity of context-free languages. Proceedings of the MFCS Symposium, High Tatras, 1973, pp. 71-83.
6. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
7. Honkala J. On slender languages. Bull. EATCS. 64:1998;145-152.
8. Honkala J. On a problem of G. Paun. Bull. EATCS. 64:1998;341.
9. Ilie L. On a conjecture about slender context-free languages. Theoret. Comput. Sci. 132:1994;427-434.
10. L. Ilie, On lengths of words in context-free languages, Theoret. Comput. Sci., in press.
11. V. Manca, C. Martin-Vide, Gh. Paun, New computing paradigms suggested by DNA computing: Computing by carving, in: L. Kari, H. Rubin, D.H. Wood (Eds.), Proceedings of the fourth International Meeting on DNA Based Computers, Pennsylvania Univ., June 1998, pp. 41-56.
12. Ouyang Q., Kaplan P.D., Liu S., Libchaber A. DNA solution of the maximal clique problem. Science. 278:1997;446-449.
13. Paun Gh. A positive answer to problem P11. Bull. EATCS. 19:1983;9-10.
14. Gh. Paun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer, Berlin, 1998.
15. Paun Gh., Salomaa A. Thin and slender languages. Discrete Appl. Math. 61:1995;257-270.
16. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, 3 volumes, Springer, Heidelberg, 1997.
17. Salomaa A. On the index of a context-free grammar and language. Inform. and Control. 14:1969;474-477.
18. A. Salomaa, Formal Languages, Academic Press, New York, 1973.