JFLAP is software for experimenting with formal languages and automata theory. In this Tips and Techniques session we describe the recent changes to JFLAP to make it more usable in an automata theory course.
DESCRIPTION OF JFLAPJFLAP[2, 3] is software for creating and experimenting with several types of automata and grammars, and for experimenting with related construction-type proofs. With JFLAP one can build an NFA, then go through the steps in converting it to a DFA, then convert it to a minimal state DFA, then convert it to a regular grammar or a regular expression. With JFLAP one can also experiment with lsystems, the simulation of the growth of plants and fractals, and parsing, such as brute force parsing, LL(1) and SLR(1) parsing. JFLAP is available for free on www.jflap.org[1].
ADDITIONS TO JFLAPIn this session we will demo new features of JFLAP to make it easier to use in lecture and to make it fit more definitions of automata. Probably the most useful feature added in the editing panes are UNDO and REDO buttons.