Simulators for formal languages, automata and theory of computation with focus on JFLAP
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
This report discusses simulators in automata theory and which one should be best for use in laboratory assignments. Currently, the Formal Languages, Automata and Theory of Computation course (FABER) at Mälardalen University uses the JFLAP simulator for extra exercises. To see if any other simulators would be useful either along with JFLAP or standalone, tests were made with nine programs that are able to graphically simulate automata and formal languages. This thesis work started by making an overview of simulators currently available.After the reviews it has become clear to the author that JFLAP is the best choice for majority of cases. JFLAP is also the most popular simulator in automata theory courses worldwide.To support the use of JFLAP for the course a manual and course assignments are created to help the student to getting started with JFLAP. The assignments are expected to replace the current material in the FABER course and to help the uninitiated user to get more out of JFLAP.
Place, publisher, year, edition, pages
2013. , 64 p.
automata simulator pushdown turing grammar regular expression
IdentifiersURN: urn:nbn:se:mdh:diva-18351OAI: oai:DiVA.org:mdh-18351DiVA: diva2:610262
Subject / course
2013-01-31, Kappa, Västerås, 13:24 (Swedish)