Back to: FsmReg
FsmRegForm
AbbrName JFLAP
FullName JFALP
ItemDesc 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.
APartOf

ContainsParts

HomePage http://www.jflap.org/
Type FsmCompiler
ImplLanguage

Author

Copyright

License

References

Availability

ProviderName

RelatedWork

Evaluation

LatestVersion ver. 6.4. July 13, 2008
Topic revision: r1 - 2008-10-24 - AnssiYliJyra
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback