Minimization of symmetric difference finite automata

Simple item page
dc.contributor.advisorVan Zijl, L.
dc.contributor.authorMuller, Graham
dc.contributor.otherUniversity of Stellenbosch. Faculty of Science. Dept. of Mathematical Sciences. Computer Science.
dc.date.accessioned2006-11-13T08:01:35Zen_ZA
dc.date.accessioned2010-06-01T08:36:41Z
dc.date.available2006-11-13T08:01:35Zen_ZA
dc.date.available2010-06-01T08:36:41Z
dc.date.issued2006-03
dc.descriptionThesis (MSc (Computer Science))--University of Stellenbosch, 2006.
dc.description.abstractThe 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 ...en
dc.format.extent1074090 bytesen_ZA
dc.format.mimetypeapplication/pdfen_ZA
dc.identifier.urihttp://hdl.handle.net/10019.1/1922
dc.subjectDissertations -- Computer scienceen
dc.subjectTheses -- Computer scienceen
dc.subjectSequential machine theoryen
dc.titleMinimization of symmetric difference finite automataen
dc.typeThesis
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
muller_minimization_2005.pdf
Size:
1.02 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.72 KB
Format:
Plain Text
Description:
Download
Collections
Masters Degrees (Mathematical Sciences)