visualFSA Small tool which lets you construct NFAs/DFAs - (non)deterministic finite automata
Download

visualFSA Ranking & Summary

visualFSA Tags

construct DFA nfa construction construct dfa nfa constructor nfa

visualFSA Description

Small tool which lets you construct NFAs/DFAs - (non)deterministic finite automata visualFSA offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.visualFSA offers the user an appealing user interface which can be used to construct finite automata. Currently, the user is bounded to the common definitions of deterministic (with a total transition function) as well as non-deterministic finite automata. The program solves e.g. the word problem (does the automaton recognize a given word w) or applies common known automata theory algorithms, like for example converting a NFA into a DFA. visualFSA aims and is intended to make the used algorithms more comprehensible, to make automata theory more concrete, and possibly, some theoretician has actually a little bit fun with this tool

visualFSA Related Software