Length considerations in context-free languages

Theoretical Computer Science

Volumn 183, Issue 1, 1997, Pages 21-32

  Raz, Danny ^a,b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; POLYNOMIALS; THEOREM PROVING;

CONSTRUCTIVE METHODS;

CONTEXT FREE LANGUAGES;

EID: 0031206858     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00308-8     Document Type: Article

References (8)

1. M. Andrasiu, J. Dassow, Gh. Pǎun and A. Salomaa, Language-theoretic problems arising from Richelieu cryptosystems, Theoret. Comput. Sci. 116 (1993) 339-357.
2. S. Ginsburg, The Mathematical Theory of Context-Free Languages (McGraw-Hill, New York, 1966).
3. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Reading, MA, 1978) 312-326.
4. L. Ilie, On a conjecture about slender context-free languages, Theoret. Comput. Sci. 132 (1994) 427-434.
5. G. Pǎun and A. Salomaa, Decision problems concerning the thinness of DOL languages. Bull. EATCS 46 (1992) 171-181.
6. G. Pǎun and A. Salomaa, Closure properties of slender languages, Theoret. Comput. Sci. 120 (1993) 293-301.
7. G. Pǎun and A. Salomaa, Thin and slender languages, DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 61 (1995).
8. D. Raz, Recurrence in formal languages, manuscript, 1996.