DFA::Simple - A Perl module to implement simple Discrete Finite Automata
my $Obj = new DFA::Simple $Actions,[States]; This creates a simple automaton with a finite number of individual states. The short version is that state numbers are just indices into the array. The state basically binds the rest of the machine togethe...ASB/DFA-Simple-0.34 - 07 Nov 2018 17:30:50 UTC
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
This is the SMC (State Machine Compiler) runtime for target language Perl. See <http://smc.sourceforge.net/>. This namespace contains two class : State the base State class FSMContext the Finite State Machine Context class...PERRAD/DFA-Statemap-1.01 - 04 Jun 2016 07:46:59 UTC
Data::DFA - Deterministic finite state parser from regular expression.
Deterministic finite state parser from regular expression. Version 20201030. The following sections describe the methods in each functional area of this module. For an alphabetic listing of all methods by name see Index....PRBRENAN/Data-DFA-20201031 - 01 Nov 2020 01:21:16 UTC