Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorCole, A. J.en
dc.contributor.authorMaroof, Adnan Abdul Kadiren
dc.coverage.spatial105pen
dc.date.accessioned2021-04-08T08:37:36Z
dc.date.available2021-04-08T08:37:36Z
dc.date.issued1985
dc.identifier.urihttps://hdl.handle.net/10023/21800
dc.description.abstractThe 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.isoenen
dc.publisherUniversity of St Andrewsen
dc.subject.lccQA276.25M2
dc.subject.lcshMathematical Statisticsen
dc.subject.lcshQA276.25M2
dc.titleAn implementation of algorithms to define and manipulate finite automata and regular expressionsen
dc.typeThesisen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnameMSc Master of Scienceen
dc.publisher.institutionThe University of St Andrewsen


This item appears in the following Collection(s)

Show simple item record