Test: Non Deterministic Turing Machines , Test: Simulation of Turing Machine , REC & Undecidability- 1 , Test: Extended Transition Function , Previous Year Questions: Regular Grammar , PPT: Introduction to Automata Theory , Check if the language is Context Free or Not , Previous Year Questions: Recursive Language , Intersection & Complement , Test: DFA Processing Strings , Regular Expressions & Finite Automata , Test: Mealy Machine , Hamiltonian Cycle: Backtracking , Test: The Language of NFA , Test: Finite Automata With Epsilon Transition , Test: Turing Machine: RE , Test: The Language of DFA , REC & Undecidability- 2 , Regular Expression to DFA , Check if the language is Context Free or Not , Pumping Lemma for Context-Free Languages , Traveling Salesman Problem , P & NP Problems , Counter Machines , Previous Year Questions: Undecidability , Pushdown Automata (PDA) , Universal Turing Machine , Halting Problem , Context Free Grammars (CFG) , Properties & PCP , Recursive Function Theory , Introduction: Pushdown Automata , PPT: Pushdown Automata (PDA) , Test: From Grammars to Push Down Automata , Introduction: Theory of Computation , Test: Union , Test: DPDA & Context Free Languages , Previous Year Questions: Regular Expression , Complexity Class P & Complexity Class NP , PPT: Regular Expressions , Types of TM: Turing Machines , Turing Machine (TM) , Complexity , Test: Applications of DFA , PPT: Introduction & Automata , Previous Year Questions: Regular Language , Test: Applications of NFA , Clique Problem , Context Free Grammar & Context Free Language , Test: Non Deterministic Turing Machines , Test: Epsilon Closures , Test: The Language of Turing Machine , The Post Correspondence Problem , Formal Representation of Languages & Chomsky Hierarchy , Previous Year Questions: Push-down Automata , Travelling Salesman Problem (TSP) , Test: Rice’s Theorem , Test: PDA-Acceptance By Final State , NFA & DFA Conversion , Test: Automata , Relationship Between Grammar & Language in TOC , PPT: Finite Automata , Simplification of Context Free Grammars , Previous Year Questions: Context Free Grammar , Test: Turing Machine & Halting , NFA to Regular Expression , Introduction to Automata Theory , Test: Regular Languages & D-PDA , Construction of Moore Machine - Examples , Pumping Lemma for Context Free Languages (CFLs) , Finite Automata With Outputs , Intersection Process of Two DFAs , Test: Turing Machine-Notation & Transition Diagrams , Context-free Grammars & Push-Down Automata , Regular Expressions & Finite Automata , Designing of Turing Machines , Test: The Language of a Grammar , Test: Identify Class Language , Pumping Lemma for Regular Languages , TM as Transducers , Proving Techniques , Pumping Lemma for Regular Languages , Previous Year Questions: Finite Automata , Test: Simpler Notations , Test: Context Free Grammar Derivations & Definitions , DFA to Regular Expression , Vertex Cover Problem , Normal Forms of Context Free Grammar , Pumping Lemma for Context Free Languages (CFLs) , Arden's Lemma , Complexity Classes P & NP , Test: Pumping Lemma , Pumping Lemma for Regular Languages , Previous Year Questions: Context Free Language , Post Correspondence Problem & Linear Bounded Automata , NP-Completeness of Vertex Cover with Proof , Regular Expression - Examples , Inferences & Ambiguity , Rice Theorem , Applications of Finite Automata , Previous Year Questions: Turing Machine , Test: Multistack Machines , Godelization , Pumping Lemma for Context-Free Languages , Test: PDA-Acceptance By Empty Stack , Test: DPDA & Ambiguous Grammars , Church’s Thesis , Minimization of DFA , Test: Turing Machine: RE , Automata with Output , Regular Expressions , Context-Sensitive Grammar (CSG) & Language (CSL) , NFA to DFA Conversion , PPT: Properties of Context-Free Languages , Test: Moore Machine , Closure Properties of Context Free Languages , Test: Pumping Lemma for Context Free Language , Test: Deterministic Finite Automata: Introduction & Definition , PPT: Turing Machines , Multitape Turing Machine , Test: Uses of Epsilon-Transitions , Closure Properties of Context Free Languages , Turing Machines & Undecidability , Relationship Between Grammar & Language , Test: From PDA to Grammars , Regular Expression , Test: Equivalence of One-Tape & Multitape TM’S , Normal Forms for CFGs , Test: Equivalence of NFA & DFA , Regular Expression to Epsilon NFA , Context-Sensitive Grammar (CSG) & Language (CSL) , Turing Recognizable & Turing Decidable , Relationship Between Grammar & Language , Computable & Non-Computable Functions , PPT: Context-Free Languages & Grammars , Minimization of Deterministic Finite Automata (DFA) , Test: Programming Techniques Storage & Subroutines , SAT (Boolean Formula Satisfiability Problem) , Pumping lemma , Equivalence of Pushdown Automata with Context-Free Grammar , Determining Accountability , Applications of Automata , Pumping Lemma for Regular Languages , Test: Non Deterministic Finite Automata , Test: Multitape Turing Machines , Hamiltonian Cycle Problem , Time Complexity of Turing Machine & Halting Problem of TM , Finite Automata , Test: Deterministic PDA