Class Notes

MODULE 1 : 

Central Concepts of Automata, DFA, NFA, NFA to DFA

NOTES | DFA_tuorial solutions | NFA Tutorial Solutions | NFA to DFA tutorial Solutions

MODULE 2 : 

Regular Expressions, DFA to RE, RE to NFA, Closure properties of Regular Languages, Minimization of Automata, Proving languages to not be regular

NOTES+minDFA Tutorial | Tutorial-RE  | Tutorial - stateElim_PumpingLemma_ClosureProperties

MODULE 3 : 

Context Free Grammars, Parse Trees, Ambiguity, Push Down Automata, language of PDA, Equivalence of CFG and PDA, Deterministic PDA

CFG Tutorial - (4,5,6,7,8,9,11)

NOTES |CFG Tutorial Set (Updated : 21.11.2025)| PDA Tutorial Grammars, Ambiguity, CFG to PDA

MODULE 4 : 

Normal Forms for Context-Free Grammars, The Pumping Lemma for Context-Free Languages, Closure

Properties of Context-Free Languages.

Module 4 Notes  (Updated : 20.11.2025)-
( correction  - for GNF for non-recursive rules when you're changing... all has to be A' )

MODULE 5 : 

Introduction to Turing Machines: Problems That Computers Cannot Solve, The Turing Machine, Programming Techniques for Turing Machines, Extensions to the Basic Turing Machine, Undecidability: A Language That Is Not Recursively Enumerable.

NOTES + TM problems Extensions to Basic TM, Undecidablility