Back to Search
Start Over
Efficient Enumeration of Regular Languages.
- Source :
- Implementation & Application of Automata (9783540763352); 2007, p226-242, 17p
- Publication Year :
- 2007
-
Abstract
- The cross-section enumeration problem is to list all words of length n in a regular language L in lexicographical order. The enumeration problem is to list the first m words in L according to radix order. We present an algorithm for the cross-section enumeration problem that is linear in n. We provide a detailed analysis of the asymptotic running time of our algorithm and that of known algorithms for both enumeration problems. We discuss some shortcomings of the enumeration algorithm found in the Grail computation package. In the practical domain, we modify Mäkinen's enumeration algorithm to get an algorithm that is usually the most efficient in practice. We performed an extensive performance analysis of the new and previously known enumeration and cross-section enumeration algorithms and found when each algorithm is preferable. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540763352
- Database :
- Complementary Index
- Journal :
- Implementation & Application of Automata (9783540763352)
- Publication Type :
- Book
- Accession number :
- 33275700
- Full Text :
- https://doi.org/10.1007/978-3-540-76336-9_22