Implementing formal languages in Maple
LE3 .A278 2006
2006
Domarat, Michael
Acadia University
Bachelor of Computer Science
Honours
Computer Science
The implementation of formal languages in Maple has proved itself worthwhile, increasing our knowledge of the subjects at hand and helping users gain intuition about regular languages using hands-on experience. Regular expression validation is a very important subject in the area of formal language theory. Research in this area is minimal and few textbooks define how regular expressions are allowed to be structured . In Maple, we implement the definition from Lee and Shallit [14] to create a regular expression validator that can be used by researchers in this field. We also develop a Maple procedure for transforming a regular expression into a finite automaton, using an algorithm from Aho et al. [2]. Lastly, we extend the finite automaton manipulation package aut.m developed by Martoi [17] to implement the operations of shuffle and shuffle on trajectories.
The author retains copyright in this thesis. Any substantial copying or any other actions that exceed fair dealing or other exceptions in the Copyright Act require the permission of the author.
https://scholar.acadiau.ca/islandora/object/theses:501