regexp * dfa_mccluskey(dfa *)
Brzozowski-McCluskey algorithm (DFAs).
Definition nfa_mccluskey.c:154
mccluskey_auto * nfa_to_mccluskey(nfa *)
Computes a generalized automaton from an arbitrary NFA.
Definition nfa_mccluskey.c:3
regexp * nfa_mccluskey(nfa *)
Brzozowski-McCluskey algorithm (NFAs).
Definition nfa_mccluskey.c:144
mccluskey_auto * dfa_to_mccluskey(dfa *)
Computes a generalized automaton from an arbitrary DFA.
Definition nfa_mccluskey.c:61
Implementation of regular expressions.
Type used to represent a complete DFA.
Definition nfa.h:61
Type used to represent the generalized automata used in the algorithm.
Definition nfa_mccluskey.h:41
regexp *** matrix
The two-dimensional array (size * size) which stores the transitions.
Definition nfa_mccluskey.h:43
uint size
The size of this automaton.
Definition nfa_mccluskey.h:42
Type used to represent a NFA.
Definition nfa.h:43
Type used to represent a single node in a regular expression.
Definition regexp.h:123