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.
Create weighted and unweighted graphs and run algorithms step by step. Learn graph theory interactively… much better than a book!
Need to test a deterministic finite automaton for an upcoming course assignment, or just curious? Then you've come to the righ ...
Social Network Visualizer (SocNetV) is a cross-platform, user-friendly application for the analysis and visualization of Socia ...
GraphThing is a tool that allows you to create, manipulate and study graphs. These "graphs" are mathematical objects that desc ...