this is a graphical interface for designing finite automata written in javascript
click here to see online demo
- creating dfa and nfa graphically
- convert nfa to dfa
- define and send unavailable symbols of every state to trap
- convert duplicate symbols of every state
- convert lambda transitions
- minimize dfa and removing useless states
- remove useless states
- minimize dfa
- export dfa as image
- reset action to remove all states
- grammar algorithms
- convert dfa to grammar
- create dfa from grammar
- remove specific transition
- make drawing transitions better and more pretty
- regex algorithms
- convert finite automata to regular expressions
- create finite automata from regular expressions
- convert regular expressions to machine-executable regex
- test finite automata with a string