This is a Deterministic Finite Automata solver created for the Theory of Computation course in the Rafik Hariri University and presented to Dr. Mohamad Al Abed.
Team Members:
Khalil Farhat
Omar Arabi
Sammy Medawar - 20210031
Wally El Sayed
Features:
DFA Representation
String acceptance
DFA minimization
DFA equivalence
Importing the created DFA
Saving the created DFA