JFLAP
af Duke University Computer Science Department
Unverified
Formal languages testing
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.
NOTE: This Flatpak is unofficial and not supported by JFLAP developers. Find officially supported jar files on jflap.org.
Ændring i version 7.1
næsten 6 år siden
(Built 6 måneder siden)
- Ingen ændringslog angivet
Installeret størrelse~177.36 MiB
Overførslens størrelse61.15 MiB
Tilgængelige arkitektureraarch64, x86_64
Installationer879