Abstract
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 a given NFA, the cross-section problem is to list all words of length n accepted by an NFA in lexicographical order, and the enumeration problem is to list the first m words accepted by an NFA according to length-lexicographic order. For the min-word and cross-section problems, we present algorithms with better asymptotic running times than previously known algorithms. Additionally, for each problem, we present algorithms with better practical running times than previously known algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ackerman, M., Shallit, J.: Efficient enumeration of words in regular languages. Theoretical Computer Science. Elsevier, Amsterdam (2009)
Anderson, T., Rampersad, N., Santean, N., Shallit, J.: Finite automata, palindromes, patterns, and borders. In: CoRR, abs/0711.3183 (2007)
Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)
University of Western Ontario, Department of Computer Science: Grail+ (December 2008), http://www.csd.uwo.ca/Research/grail/index.html
Mäkinen, E.: On lexicographic enumeration of regular and context-free languages. Acta Cybernet. 13, 55–61 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ackerman, M., Mäkinen, E. (2009). Three New Algorithms for Regular Language Enumeration. In: Ngo, H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02882-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02882-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02881-6
Online ISBN: 978-3-642-02882-3
eBook Packages: Computer ScienceComputer Science (R0)