Sciweavers

COCOON
2009
Springer
13 years 8 months ago
Three New Algorithms for Regular Language Enumeration
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
Margareta Ackerman, Erkki Mäkinen