Skip to content

Implementation of a class for creating deterministic finite state machines, two examples are presented. The first practice on the subject "Theory and development of programming languages"

License

Notifications You must be signed in to change notification settings

L1tewave/dfa-implementation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

DFA Implementation

Python version >=3.8 is required to run this program


A class representing a finite automaton is implemented. As an example, two finite automata are created, which can also be run with JFLAP.


Sample program launch:

 $ python main.py c
 The type of finite state machine you have selected 
 is not included in the available ones: ['a', 'b']
 Try again!
 
 $ python main.py b
 
 Your choice is: A nondeterministic finite automaton with 
 the number of states not exceeding 3 for the language {ab, abc}*.
 
 Note: Press <Ctrl+C> or <Ctrl+Z> to exit from program
 
 >> ababc
 Accepted
 >> ababcb
 Rejected
 >> ^Z
 Bye
 
 $ |

About

Implementation of a class for creating deterministic finite state machines, two examples are presented. The first practice on the subject "Theory and development of programming languages"

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages