Theory of Computation

• Tech Stack: C, Python
• Github URL: Project Link

Implemented various automata and formal language concepts in a team of 3 members, such as pushdown automata (PDA), conversion of non-deterministic finite automata (NFA) to deterministic finite automata (DFA), minimization of DFA, and purification of context-free grammars (CFG)

Simulated a Turing Machine to determine if a given string belongs to a specific grammar