Skip to content

Implementation of automata theory

License

Notifications You must be signed in to change notification settings

nerstak/L2-Finite-Automata-Math-CS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

76 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

___________.__       .__  __              _____          __                         __          
\_   _____/|__| ____ |__|/  |_  ____     /  _  \  __ ___/  |_  ____   _____ _____ _/  |______   
|    __)  |  |/    \|  \   __\/ __ \   /  /_\  \|  |  \   __\/  _ \ /     \\__  \\   __\__  \  
|     \   |  |   |  \  ||  | \  ___/  /    |    \  |  /|  | (  <_> )  Y Y  \/ __ \|  |  / __ \_
\___  /   |__|___|  /__||__|  \___  > \____|__  /____/ |__|  \____/|__|_|  (____  /__| (____  /
    \/            \/              \/          \/                         \/     \/          \/

Features

  • Main loop
  • Standardization
  • Complementary Language
  • Word recognition
  • Minimization
  • Completion
  • Determinization
  • (A)Synchronous FA
  • Displaying FA
  • Reading FA from file
  • FA creation

Using the program

You need to compile every .cpp and .h files. If you are using CMAKE, you should be able to use the CMakeList.

We recommend C++ 17.

The program is fully working inside a terminal.

About

Implementation of automata theory

Topics

Resources

License

Stars

Watchers

Forks

Contributors 4

  •  
  •  
  •  
  •