On Lexicographic Enumeration of Regular and Context-Free Languages

We show that it is possible to eeciently enumerate the words of a regular language in lexicographic order. The time needed for generating the next word is On when enumerating words of length n. W e also deene a class of context-free languages for which ecient e n umeration is possible.

[1]  Erkki Mäkinen.  Ranking and unranking left szilard languages , 1998, Int. J. Comput. Math..

[2]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[3]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

[4]  Gheorghe Paun,et al.  Closure Properties of Slender Languages , 1993, Theor. Comput. Sci..

[5]  Erkki Mäkinen,et al.  On context-free derivations , 1985 .

[6]  Erkki Mäkinen,et al.  A Survey on Binary Tree Codings , 1991, Comput. J..