Package regaut

Regular expressions and finite-state automata.

See: Description

Class Summary

Class	Description
Alphabet	Representation of an alphabet.
FA	Deterministic finite state automaton.
NFA	Nondeterministic finite state automaton with transitions.
RegExp	Regular expression.
State	An automaton state.
StateSymbolPair	A pair of a state and an alphabet symbol.

Exception Summary

Exception	Description
AutomatonNotWellDefinedException	Exception caused by an automaton not being well-defined.

Package regaut Description

Regular expressions and finite-state automata.

This package contains an implementation of the regular expression and automaton algorithms from [Martin] (John Martin, Introduction to Languages and the Theory of Computation, 4th edition, McGraw-Hill, 2010). The representation of automata is quite naive but closely reflects the mathematical definitions.