An assessment of selected algorithms for generating failure deterministic finite automata

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 based algorithm called the DFA - Homomorphic Algorithm (DHA) was proposed t...

Full description

Bibliographic Details
Main Author: Nxumalo, Madoda
Other Authors: Kourie, Derrick G.
Language:en
Published: 2016
Subjects:
Online Access:http://hdl.handle.net/2263/57216
Nxumalo, M 2016, An assessment of selected algorithms for generating failure deterministic finite automata, MSc Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/57216>