← Back to CS402
Decidability and Parsing Techniques | Theory of Automata | CS402_Lecture45
CS402 — Theory of Automata
Other Lectures
Introduction to Languages and Computer Theory | Theory of Automata | CS402_Lecture01Kleene’s Star Closure | Theory of Automata | CS402_Lecture02Regular Expression | Theory of Automata | CS402_Lecture03Equivalent Regular Expressions | Theory of Automata | CS402_Lecture04Finite Automaton | Theory of Automata | CS402_Lecture05Equivalent FAs | Theory of Automata | CS402_Lecture06FA corresponding to finite languages | Theory of Automata | CS402_Lecture07Transition Graph | Theory of Automata | CS402_Lecture08Generalized Transition Graphs | Theory of Automata | CS402_Lecture09Nondeterminism and Kleene’s Theorem | Theory of Automata | CS402_Lecture10Kleene’s Theorem Part II | Theory of Automata | CS402_Lecture11Kleene’s Theorem Part III | Theory of Automata | CS402_Lecture12Kleene’s Theorem Part III | Theory of Automata | CS402_Lecture13Kleene’s Theorem Part III (Continue) | Theory of Automata | CS402_Lecture14Nondeterministic Finite Automaton (NFA) (Continue) | Theory of Automata | CS402_Lecture15NFA with Null String | Theory of Automata | CS402_Lecture16NFA and Kleene’s Theorem | Theory of Automata | CS402_Lecture17NFA corresponding to Concatenation of FAs | Theory of Automata | CS402_Lecture18Distinguishable strings and Indistinguishable strings | Theory of Automata | CS402_Lecture19Moore machine | Theory of Automata | CS402_Lecture20Mealy machine | Theory of Automata | CS402_Lecture21Equivalent machines | Theory of Automata | CS402_Lecture22Finite Automata with Output | Theory of Automata | CS402_Lecture23Regular languages and Complement of a language | Theory of Automata | CS402_Lecture24Nonregular languages | Theory of Automata | CS402_Lecture25Pumping Lemma | Theory of Automata | CS402_Lecture26Pumping Lemma version II | Theory of Automata | CS402_Lecture27Pseudo theorem | Theory of Automata | CS402_Lecture28Decidability | Theory of Automata | CS402_Lecture29Determining whether the two languages are equivalent or not ? | Theory of Automata | CS402_Lecture30Context Free Grammar (CFG) | Theory of Automata | CS402_Lecture31Trees | Theory of Automata | CS402_Lecture32Polish Notation (o-o-o) | Theory of Automata | CS402_Lecture33Regular Grammar | Theory of Automata | CS402_Lecture34Null Production | Theory of Automata | CS402_Lecture35Chomsky Normal Form (CNF) | Theory of Automata | CS402_Lecture36Chomsky Normal Form (CNF) | Theory of Automata | CS402_Lecture37Nondeterministic PDA | Theory of Automata | CS402_Lecture38PDA corresponding to CFG | Theory of Automata | CS402_Lecture39Conversion form of PDA | Theory of Automata | CS402_Lecture40Conversion form of PDA (Continued) | Theory of Automata | CS402_Lecture41Conversion form of PDA (Continue) | Theory of Automata | CS402_Lecture42Non-Context-Free language and Pumping lemma for CFLs | Theory of Automata | CS402_Lecture43Decidability and Parsing Techniques | Theory of Automata | CS402_Lecture44