410 likes | 1.06k Views
JFLAP. The shortest PowerPoint ever. JFLAP – What is it?. Java applet to help make diagrams for: DFA NFA regular grammar regular expression Also does conversion from DFA NFA. JFLAP – Where can I get it?. http://www.jflap.org/ - Main website http://java.sun.com/ - Java website
E N D
JFLAP The shortest PowerPoint ever.
JFLAP – What is it? • Java applet to help make diagrams for: • DFA • NFA • regular grammar • regular expression • Also does conversion from DFA NFA
JFLAP – Where can I get it? • http://www.jflap.org/ - Main website • http://java.sun.com/ - Java website • The Java Runtime Environment is required
Running JFLAP • Install the JRE • Navigate to http://www.jflap.org/getjflap.html • An applet window will appear
Simple DFA • Select “Finite Automaton”
Adding Nodes • Click this here button
Adding Nodes • Now click on the workspace to add it
Setting the initial state • Click the “attribute editor” button
Setting the initial state • Right click on the node and select initial
Setting accept states • Right click on any node and select Final
Making transitions for nodes • Click the “transition creator”
Making transitions for nodes • Now simply click and drag between any two nodes!
Making transitions for nodes • After dragging, just specify what transition is being made. • Single-clicking on any node will add a reflexive transition • Separate multiple input transitions by commas (ex: 0,1)
Deleting nodes, transitions • Click the skull & crossbones
Testing input • Input -> Fast Run
Adding JFLAP to homework • Finish your DFA/NFA in JFLAP • Hold ALT+ PRNT SCRN • Open MSPaint (run->pbrush) • Paste the screenshot from the clipboard • Use the rectangular marquee to select just the DFA/NFA you made • Paste the DFA/NFA into your document
Other Features • Save - Save your DFA/NFA • File -> Save • Convert • No idea how to do this • Input Options • State-by-state run