On Lexicographic Enumeration of Regular and Context-Free Languages

@article{Mkinen1997OnLE,
  title={On Lexicographic Enumeration of Regular and Context-Free Languages},
  author={Erkki M{\"a}kinen},
  journal={Acta Cybern.},
  year={1997},
  volume={13},
  pages={55-61}
}
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 O(n) when enumerating words of length n. We also deene a class of context-free languages for which eecient enumeration is possible. 

References

Publications referenced by this paper.
Showing 1-7 of 7 references

A survey on binary tree codings

  • E Mm Akinen
  • Comput. J
  • 1991

On context-free derivations

  • E Mm Akinen
  • Acta Universitatis Tamperensis
  • 1985

Introduction to Formal Language Theory

  • M A Harrison
  • Introduction to Formal Language Theory
  • 1978

Context-free languages are closed under min operation. Manuscript, submitted for publication

  • D Raz
  • Context-free languages are closed under min…

Similar Papers

Loading similar papers…