Formal Languages and Automata Theory Course Content How to Study Theory of Computation TOC Introduction to Formal Languages and Automata Theory Example to Understand Finite Automata Deterministic Finite Automata DFA Example 1 DFA with Dead State Example DFA Example 2 DFA with Dead State Example 1 DFA with Multiple Final States DFA Examples on Counting DFA Example on Counting 1 DFA Example on Counting 2 DFA Practice Examples DFA Example on Division Nondeterministic Finite Automata NFA Examples 1 NFA Practice Examples NFA to DFA Example NFA to DFA Dead State Example NFA to DFA with Multiple Final States Example Minimization of DFA Example Minimization of DFA Non Reachable States Example Minimization of DFA Multiple Final States Example NFA with Epsilon Moves NFA with Epsilon Moves to NFA NFA with Epsilon Moves to NFA Practice Example Symbols Alphabet String and Language in TOC Regular Expressions Regular Expression Operators Regular Expression to Finite Automata Union and Concatenation Regular Expression to Finite Automata Closure Regular Expression Operator Precedence Regular Expression Examples DFA to Regular Expression Using Ardens Theorem DFA to Regular Expression Multiple Final States Complex Regular Expression Example DFA to Regular Expression State Elimination Method DFA to RE State Elimination Multiple Final and Dead State Example Regular Expression to Finite Automata Examples Identity Rules of Regular Expressions Equivalence of Two Regular Expressions Failure Case of Finite Automata Regular Language Closure Properties Reverse of a Regular Language Grammar TOC Regular Grammar Right and Left Linear Grammar Right and Left Linear Grammar Acceptance of Strings Finite Automata to Right and Left Linear Grammar Finite Automata to Right and Left Linear Grammar Practice Example Left Linear Grammar to Finite Automata Pumping Lemma for Regular Languages Moore Machine Mealy Machine Moore Machine to Mealy Machine Mealy to Moore Machine Gate Bits FA and RE 1 Gate Bits FA and RE 2 Gate Bits FA and RE 3 Gate Bits FA and RE 4 Gate Bits FA and RE 5 Gate Bits FA and RE 6 Context Free Grammar and Language Context Free Grammar Examples Left and Right Most Derivation Tree Design Context Free Grammar Example 1 Design Context Free Grammar Examples 2 Ambiguous Grammar Eliminating Left Recursive Grammar Eliminating Left Recursion Examples Eliminating Epsilon Productions Eliminating Unit Productions Eliminating Useless Productions Chomsky Normal Form(CNF) Greibach Normal Form (GNF) CYK Membership Algorithm Understanding Push Down Automata Instantaneous Description of PDA Acceptance of PDA Deterministic Push Down Automata DPDA Non Deterministic PDA NDPDA PDA Example Failure Case of Push Down Automata Pumping Lemma for Context Free Languages Closure Properties of Context Free Languages Context Sensitive Grammar and Language Context Sensitive Grammar Example Gate Bits 1 CFL and PDA Gate Bits 2 CFL and PDA Gate Bits 3 CFL and PDA Gate Bits 4 CFL and PDA Turing Machine in TOC Constructing Turing Machine Theory of Computation Acceptance of Turing Machine by Halt State Instantaneous Description Turing Machine Turing Machine Example Turing Machine as Adder Turing Machine as Subtractor Turing Machine as Comparator Non Halting Turing Machine Universal Turing Machine
