Note that this is a fun personal project, nowhere near fully functional

• DFA : Deterministic Finite Automata
• NFA : Non-deterministic Finite Automata
• EFA : NFA with ε steps
• RE : Regular Expression Valued Automata
• G : Regular Grammar

• PDA : Pushdown Automata
• CFG : Context free Grammar
• TopDown analyzer
• BottomUp analyzer

+------------------------------------------+
|      DETERMINISTIC FINITE AUTOMATA       |
+------------------------------------------+

Q  = {1, 2, 3, 4, 5, 6, 7}
Σ  = {a, b}

+---+-----+-----+
|   |  a  |  b  |
+---+-----+-----+
| 1 |  2  |  -  |
| 2 |  3  |  4  |
| 3 |  6  |  5  |
| 4 |  3  |  2  |
| 5 |  6  |  3  |
| 6 |  2  |  -  |
| 7 |  6  |  1  |
+---+-----+-----+

I = {1}
F  = {3, 5, 6}

• minimize DFA
• convert NFA to DFA
• convert EFA to NFA
• convert Grammar to NFA
• reduce CFG
• remove ε steps from CFG
• convert CFG to "own" grammar (not sure by the translation)
• convert CFG to CNF (Chomsky's normal form)
• remove left recursion from CFG
• convert CFG to GNF (Greibach's normal form)
• construct analyzer PDA's from CFG