JFLAP is a software tool for experimenting with finite automata, pushdown automata, Turing machines, grammars, parsing and L-systems. In addition to constructing and testing examples for these, JFLAP allows one to experiment with construction proofs from one form to another, such as converting an NFA to a DFA to a minimal state DFA to a regular expression or regular grammar.
Engineering Pathways Premier Award Winner
Users are free to copy, distribute, display and perform the work and to make derivative works. You must attribute the work. You may not use the work for commercial use purposes without permission from the author. If you alter, transform, or build on this work, you should use a similar copyright.