Project descriptionthis is the "Theory of Languages and Automota" course project using this project you can give a DFA or NFA of a machine and as an output you have accesses to:
-
check if it is a valid DFA/NFA
-
find the corresponding regular expression of machine
-
make simple DFA
-
conver DFA to NFA
...