Implementing formal languages in Maple
LE3 .A278 2006
Bachelor of 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  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. . Lastly, we extend the finite automaton manipulation package aut.m developed by Martoi  to implement the operations of shuffle and shuffle on trajectories.
The author grants permission to the University Librarian at Acadia University to reproduce, loan or distribute copies of my thesis in microform, paper or electronic formats on a non-profit basis. The author retains the copyright of the thesis.