Skip to content

This small application allows to create and simulate any Deterministic or Non-Deterministic Finite Automata (DFA or NFA) as well as Turing Machines (TM).

Notifications You must be signed in to change notification settings

yurifw/Visual-Automata-Simulator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 

Repository files navigation

Visual-Automata-Simulator

This small application allows to create and simulate any Deterministic or Non-Deterministic Finite Automata (DFA or NFA) as well as Turing Machines (TM).

Features

  • Creates, simulates and transforms DFA and NFA machines
  • Creates and simulates TM
  • Batch tests for TM: useful features to test a bunch of files quickly!
  • Easy-to-use GUI interface (multi-documents)
  • Smart links between objects
  • Machines can be drawn using the mouse - and resized at any time
  • Multiple machines can be created in a single document
  • Multiple documents can be opened at the same time
  • Documents can be saved and reloaded from disk
  • Debug mode to see exactly how the machine is working (each step has a different color)
  • Export any machine to EPS file
  • Mac OS X GUI compliant

Screenshots

NFA accepting strings over {a, b, c} whose last symbol is unique

NFA accepting strings over {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} representing numbers evenly divisible by 4

A TM accepting strings with more a's than b's and more b's than c's

A TM computing the modulo of two integers

Credits

This was originally developed by Jean Bovet and was uploaded here with his authorization because if i have some spare time in the future I inted to continue the development.

About

This small application allows to create and simulate any Deterministic or Non-Deterministic Finite Automata (DFA or NFA) as well as Turing Machines (TM).

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages