Files in this item
An implementation of algorithms to define and manipulate finite automata and regular expressions
Item metadata
dc.contributor.advisor | Cole, A. J. | en |
dc.contributor.author | Maroof, Adnan Abdul Kadir | en |
dc.coverage.spatial | 105p | en |
dc.date.accessioned | 2021-04-08T08:37:36Z | |
dc.date.available | 2021-04-08T08:37:36Z | |
dc.date.issued | 1985 | |
dc.identifier.uri | https://hdl.handle.net/10023/21800 | |
dc.description.abstract | The main purpose of the work described in this chapter is to enable the user to define and modify deterministic and non-deterministic finite automata. The first step is to allow the user to define states and transitions for both deterministic and non-deterministic finite state automata and to subsequently modify them. It is possible at this stage to systematically rename final and other states. Functions are provided to convert non-deterministic finite automata to deterministic finite automata and also to trim and minimize automata. The minimization process produces a minimum state automaton. We will abbreviate the expressions deterministic finite automata and non-deterministic finite automata to DFA and NBFA respectively. | en |
dc.language.iso | en | en |
dc.publisher | University of St Andrews | en |
dc.subject.lcc | QA276.25M2 | |
dc.subject.lcsh | Mathematical Statistics | en |
dc.subject.lcsh | QA276.25M2 | |
dc.title | An implementation of algorithms to define and manipulate finite automata and regular expressions | en |
dc.type | Thesis | en |
dc.type.qualificationlevel | Doctoral | en |
dc.type.qualificationname | MSc Master of Science | en |
dc.publisher.institution | The University of St Andrews | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.