Nxumalo, Madoda
(University of Pretoria, 2016)
A Failure Deterministic Finite Automaton (FDFA) o ers a deterministic
and a compact representation of an automaton that is used by various algorithms
to solve pattern matching problems e ciently. An abstract, concept
lattice ...