Formal Languages & Automata Theory (TOC)
☞ Introduction to finite automata and DFA with examples☞ Deterministic finite automata with examples-1
☞ Deterministic finite automata with examples-2
☞ Non Deterministic finite automata
☞ Non Deterministic finite automata with examples-1
☞ Non Deterministic finite automata with examples-2
☞ NFA to DFA conversion with examples
☞ Conversion of NFA with epsilon to NFA without epsilon with examples
☞ Minimization of DFA with examples-1
☞ Minimization of DFA with examples-2
☞ Finite Automata with outputs
☞ Moore machine construction with examples-1
☞ Moore machine construction with examples-2
☞ Construction of melay machine with examples
☞ Construction of melay machine with examples
☞ Introduction to Regular Expressions
☞ Examples of Regular Expressions - part1
☞ Examples of Regular expressions - Part 2
☞ identity rules of regular expressions
☞ Algebraic laws of regular expressions
☞ Arden's theorem for regular expressions
☞ Equivalence of DFA and RE -- Conversion from DFA to Regular Expression
☞ Conversion from DFA to Regular expressions- Example-2
☞ Conversion from DFA to Regular expression -Example -3
☞ Pumping Lemma for regular expressions
☞ Conversion from Regular expression into Finite automata examples
☞ Pumping Lemma -Examples-1
☞ Pumping Lemma Examples-2
☞ pumping Lemma Examples-3
☞ Introduction to Regular Grammar and types of regular grammar
☞ Conversion from Regular expression into Finite Automata
☞ Conversion from Finite Automata into Regular Grammar
☞ Conversion from Finite automata to Regular Grammar
☞ Conversion from Regular Grammar to Finite Automata