Enumerating the strings of regular languages

Authors:
M. Douglas Mcilroy
Affiliations:
Dartmouth College, Hanover, NH 03755, USA (e-mail: doug@cs.dartmouth.edu)
Venue:
Journal of Functional Programming
Year:
2004

Citing 6
Cited 2

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Finite automata

Handbook of theoretical computer science (vol. B)
Generating power of lazy semantics

Theoretical Computer Science - Special volume on computer algebra
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Proof-directed debugging

Journal of Functional Programming
Enumerating the strings of regular languages

Journal of Functional Programming

Enumerating the strings of regular languages

Journal of Functional Programming
Adapting functional programs to higher order logic

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Haskell code is developed for two ways to list the strings of the language defined by a regular expression: directly by set operations and indirectly by converting to and simulating an equivalent automaton. The exercise illustrates techniques for dealing with infinite ordered domains and leads to an effective standard form for nondeterministic finite automata.