Skip to content

Given a formal description of a DFA, this app will represent it in a graphical interface.

Notifications You must be signed in to change notification settings

georgevanuta/DFA-NFA-Graphical-Interface

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 

Repository files navigation

DFA / NFA Graphical Visualization Tool

Visualize FA's by imputing their code in a .dfa / .nfa file and compiling it using this program.

DFA / NFA Graphic Visualization Tool

Example

FA format

First line: "--" Followed by a short description of your DFA.
Second line: The start state.
Following lines: The FA instructions, being of the format:
<CURRENT_STATE> [<CHARACTERS>] <NEXT_STATE>
Last line: The accepts states, separated by spaces.

Example of dfa code:

--Even Binary Number Tester
init
init 0 even
init 1 odd
even 0 even
even 1 odd
odd 0 even
odd 1 even
even

Restrictions

  • The name of the states to be at most 6 characters.
  • Each member of the alphabet to be at most 3 characters (Mostly applies when having 7+ states).
  • The number of states to be at most 14.

Notes

You can play around with different FA's locatated in the tests folder and see how they are going to be rendered.

What's in plan?

  • an animation showing the different states the DFA goes through processing a string.
  • add dark mode.
  • increase the limit of states by making the window slidable.
  • add support for NFA's.

About

Given a formal description of a DFA, this app will represent it in a graphical interface.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages