Three New Algorithms for Regular Language Enumeration

  • Authors:

  • Margareta Ackerman;Erkki Mäkinen

  • Affiliations:

  • University of Waterloo, Waterloo, Canada;University of Tampere, Tampere, Finland

  • Venue:
  • COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.