Unusual Algorithms for Lexicographical Enumeration

 Pál Dömösi 2

  Acta Cybernetica 14 (2000) 461-468.

Abstract:

 Using well-known results, we consider algorithms for finding minimal words of given length n in regular and context-free languages. We also show algorithms enumerating the words of given length n of regular and context-free languages in lexicographical order.

Footnotes

  1. The research has been supported by the Academy of Finland grant 137358 and the Hungarian National Foundation for Scientific Research grants OTKA-T019392 and OTKA-T030140. .2. L. Kossuth University, Institute of Mathematics and Informatics, 4032 Debrecen, Egyetem tér 1, Hungary, domosi@math.klte.hu

 Kocsorne Sebo Marianna