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 ...
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:sun/oai:scholar.sun.ac.za:10019.1/1922 |
| Date | 03 1900 |
| Creators | Muller, Graham |
| Contributors | Van Zijl, L., University of Stellenbosch. Faculty of Science. Dept. of Mathematical Sciences. Computer Science. |
| Source Sets | South African National ETD Portal |
| Detected Language | English |
| Type | Thesis |
| Format | 1074090 bytes, application/pdf |
Page generated in 0.0022 seconds