JFLAP
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.
7.1 අනුවාදයෙහි වෙනස්කම්
almost 6 years ago
(Built 5 months ago)
- වෙනස්කම් සටහනක් සපයා නැත
ස්ථාපිත ප්රමාණය~177.36 MiB
බාගැනෙන ප්රමාණය61.15 MiB
තිබෙන නිර්මාණ ශිල්පaarch64, x86_64
ස්ථාපන719