1.3.0-SNAPSHOT

• Testing panel
• Library of examples of automatons
• Support for state-transition table and adjacency matrix representations
• PDA to CFG conversion algorithm
• Hellings algorithm

1.2.1

• Add "Enable all hints" setting

1.2.0

• Static layout
• Dynamic layout
• Minimization of finite automata
• Regular expression to finite automaton conversion
• Improved hints

1.2.0-SNAPSHOT

• Static layout
• Dynamic layout
• Minimization of finite automata
• Regular expression to finite automaton conversion
• Improved hints

1.1.0

• Russian language support
• Mealy machine to Moore machine conversion
• Moore machine to Mealy machine conversion
• Epsilon-transition elimination
• Turing machine with building blocks
• Determinization of finite automata

1.1.0-SNAPSHOT

• Russian language support
• Mealy machine to Moore machine transformation
• Moore machine to Mealy machine transformation
• Epsilon-transition elimination
• Turing machine with building blocks
• Determinization of finite automata

v1.0.0

• Automaton types
  • DFA, NFA, epsilon-NFA
  • PDA, n-PDA, DPDA, n-DPDA
  • Register automaton
  • Mealy machine, Moore machine
  • TM, multi-tape TM, multi-track TM, TM with registers
• Automaton graph editing and visualization
  • State and transition addition, editing, and deletion
  • State moving
  • Group selection
  • Graph pane zooming and scrolling
  • Undoing and redoing performed operations
• Simulation
  • Instant simulation
  • Step by state simulation
  • Step by closure simulation
  • Execution tree
  • Advancing and restarting execution for individual execution states
  • Freezing executions states
  • Viewing execution states associated with given state
• Other features
  • Non determinism detection
  • Epsilon-transition detection
  • Problem detection
  • Serialization