JFLAP
|
|
| Audience/Grade: | College Freshman - College Senior |
| Discipline(s): |
Computer Engineering Computer Science Information Systems |
| Special Topic(s): |
Premier Award Winner Associate Editor's Choice |
| Learning Resource Type: | Teaching - Software Tool/Environment |
| Media Type: | Tool |
| Author(s): | Susan Rodger, Thomas Finley, Stephen Reading, Bartlett Bressler, Ryan Cavalcante, Jinghui Lim, Chris Morgan, Kyung Min (Jason) Lee |
| Description: | 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. |
| Rating: |
 |
| Related Resources | |
| Keywords: | formal methods, theory of computation |
| Referenced By |
"Today in History" Blog of the Engineering Pathway Digital Library 05-28-1936 Turing Machines and Automata Neural Networks with Java |
| Usage Tip | |
| Use of Resource: |
Experimenting with concepts in Formal Languages I use this software in a formal languages and automata course during lecture to work problems with students. Students can then it for solving homework problems. |
| Difficulty: | Medium |
| Interactivity Level: | Medium |
| Version Info | |
| Publication Date: | 2006 |
| Platform/Format: | WWW |
| Cost: | Free |
| Download URL: | http://www.jflap.org |
| Installation Notes: | Version 6.1 |
| Copyright and Use Restrictions: | 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. |
| Metadata: | IEEE LOM Record |
| Collection: |
NEEDS
|
