This repository contains implementations of automata theory algorithms
- Basic Automata classes
- Contruct automata from Regex: Contructs a Nondeterministic Finite Automata from a Regex representation(using thompson Contructions).
- NFA to DFA: Converts a Nondeterministic Finite Automata to a Deterministic Finite Automata using the subset contruction algorithm.