On lexicographic enumeration of regular and context-free languages

Acta Cybernetica

Volumn 13, Issue 1, 1997, Pages 55-61

  Mäkinen, Erkki ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3242835396     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, 1978).
2. E. Mäkinen, On context-free derivations. Acta Universitatis Tamperensis 197 (1985).
3. E. Mäkinen, A survey on binary tree codings. Comput. J. 34 (1991) 438-443.
4. E. Mäkinen, Ranking and unranking left Szilard languages. Dept. of Computer Science, University of Tampere. Report A-1997-2, January 1997.
5. G. Pǎun and A. Salomaa, Closure properties of slender languages. Theoret. Comput. Sci. 120 (1993), 293-301.
6. D. Raz, Context-free languages are closed under min operation. Manuscript, submitted for publication.
7. S. Zaks, Lexicographic generation of ordered trees. Theor. Comput. Sci. 10 (1980) 63-82.