formal-languages-and-automata

Project no. 1

• NFA (Nondeterministic Finite Automaton) - and implicitly DFA (Deterministic Finite Automaton) - Membership;
• Generating the shortest 100 words accepted by an automaton.

Project no. 2

Conversion of Lambda-NFA to Minimal DFA

Project no. 3

Regular Grammar -> Lambda-Free Regular Grammar -> Equivalent Finite State Automaton (NFA) -> DFA