DFA::Kleene - Kleene's Algorithm for Deterministic Finite Automata River stage zero No dependents

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
1 result (0.026 seconds)