amirkabiri/finite-automata

Graphical interface for designing finite automata

Finite Automata

this is a graphical interface for designing finite automata written in javascript

Online Demo

click here to see online demo

Tasks

• 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

finite-automata's Issues

Bug in renaming start state

Can't rename start state to a non-existing state

Issue during testing

Whenever there are two transition like this in between two states, the program thinks one of the transitions fails no matter what.
For example, this automaton should both accept 101 and 010 as inputs, but the program only thinks that 010 is valid and rejects 101.

not saving after converting nfa to dfa

after converting nfa to dfa, converted dfa is not saving in the localStorage immediately,
and if refresh the browser, previous nfa will be showing