Formal Translation Models

Post date: Feb 07, 2011 3:2:42 PM

Reading and Hands-on: JFLAP is software for experimenting with formal languages topics including Non-deterministic 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.

Download the JFLAP tool from http://www.cs.duke.edu/csed/jflap/jflaptmp/oct11-09/JFLAP.jar You need to install java to run this tool on your system.

you refer to the documentation of the tool at http://www.jflap.org/tutorial/