Search results for "module:DFA::Kleene"
DFA::Kleene - Kleene's Algorithm for Deterministic Finite Automata
The routines in this module allow you to define a Deterministic Finite Automaton and to compute the "language" (set of "words" or "patterns") accepted (= recognized) by it. Actually, a list of regular expressions is generated which describe the same ...
STBEY/DFA-Kleene-1.0 - 07 Aug 1997 06:09:03 UTC