JFLAP Version 7.0
JFLAP is software for experimenting with formal languages topics including nondeterministic finite automata, nondeterministic pushdown automata, multi-tape Turing machines, several types of 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. Click here for more information on what one can do with JFLAP.
Announced Oct, 12, 2007 at FIE 2007, JFLAP 6.1 is recognized as a finalist candidate in the NEEDS Premier Award for Excellence in Engineering Education Courseware competition. Here is the press release and the submission packet . See the Slides presented at the award ceremony.
|The National Science Foundation has supported JFLAP for many years. Grants include DUE-9354791 (transfered to DUE-9596002) , DUE-9555084, DUE-9752583, DUE-0442513 and DUE-1044191. Any opinions, finding and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.|
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License.
since June 27, 2005.
Over 55,000 hits occured on the previous JFLAP web page from 1996 to June 2005.
Google Analytics was added on Sept. 13, 2012. For the one-year period from Oct 1, 2012-Sept 30, 2013. there were 81,001 visits with 63,246 unique visitors.