Minimization of symmetric difference finite automata

Muller, Graham (2006-03)

Thesis (MSc (Computer Science))--University of Stellenbosch, 2006.


The minimization of a Finite Automaton (FA) deals with the construction of an equivalent FA with the least number of states. Traditional FAs and the minimization thereof is a well defined and researched topic within academic literature. Recently a generalized form of the FA, namely the generalized FA(*-FA), has been derived from these traditional FAs. This thesis investigates the minimization and reduction of one case of ...

Please refer to this item in SUNScholar by using the following persistent URL:
This item appears in the following collections: