Implementation of various automata and related algorithms in C++. Part of the "Languages and Automata" and "Machines and Computability" course at the University of Antwerp, that goes over the theory of automata, finite state machines, regular expressions, context-free grammars, pushdown automata, and Turing machines.
V = Implemented
X = Not implemented
Blank = TODO
| Functionality | Status |
|---|---|
| DFA | V |
| NFA | V |
| ENFA | V |
| SSC | V |
| MSSC | V |
| Product Automata | V |
| Regular Expression | V |
| REGEX to ENFA | V |
| State Elimination (DFA to REGEX) | |
| Table Filling Algorithm | V |
| CFG | V |
| PDA | V |
| CNF | V |
| LL | V |