### Related posts:

- TOC#01 | What is DFA in Hindi video | Automata
- TOC#02 | What is NFA in Hindi video | Automata
- TOC#03 | Trap State in Hindi video | Automata
- TOC#04 | Draw a DFA accepting strings starting with ab | Theory of computation in Hindi video
- TOC#05 | Draw a DFA starting with ‘a’ | Theory of computation in Hindi video
- TOC#06 | Draw a DFA starting with ‘aba’ | Theory of computation in Hindi video
- TOC#07 | Draw a DFA accepting strings starting with ‘aa’ | Theory of computation in Hindi video
- TOC#08 | Draw a DFA starting with ‘aa’ or ‘bb’ | Theory of computation in Hindi video
- TOC#09 | Draw a DFA ending with ‘ab’ | Theory of computation in Hindi video
- TOC#10 | Draw a DFA ending with ‘abb’ | Theory of computation in Hindi video
- TOC#11 | DFA for the language {w/w contains the substring abab} | Theory of computation in Hindi video
- TOC#12 | Minimization of DFA | Theory of computation in Hindi video
- TOC#13 | NFA accepting strings starting with a | Theory of computation in Hindi video
- TOC#14 | Draw a NFA for strings starting with ‘ab’ | Theory of computation in Hindi video
- TOC#15 | Design a NFA for {c b a bn } | Theory of computation in Hindi video
- TOC#16 | Construct a finite automata for language {0n | n mod 3 = 2, n ≥ 0} | TOC in Hindi video
- TOC#17 | Design a Finite Automata which accepts set of strings containing four 1’s | Theory of computation
- TOC#18 | Draw a NFA and DFA for the language accepting strings ending with ‘aa’ in Hindi video
- TOC#19 | Draw a NFA and convert to DFA for the language accepting strings ending with ‘b’ in Hindi video
- TOC#20 | NFA to DFA conversion example 2 | Automata |Theory of computation in Hindi video
- TOC#21 | NFA to DFA conversion example 03 | subset conversion methods | TOC in Hindi video
- TOC#22 | Mealy to Moore Conversion | Theory of computation in Hindi video
- TOC#23 | Moore to Mealy conversion | Theory of computation in Hindi video
- TOC#24 | DFA NFA accepting string ending with 00 and 11 | Theory of computation in Hindi video
- TOC#25 | Regular Expression in TOC | Theory of computation in Hindi video
- TOC#26 | Regular Expression examples | TOC in Hindi video
- TOC#27 | Regular Expression to NFA example 01 | TOC in Hindi video
- TOC#28 | Regular Expression to NFA solved examples 02 | TOC in Hindi video
- TOC#29 | Arden’s Theorem proved | TOC in Hindi video
- TOC#30 | Ardens Theorem solved examples | Regular Expression from Automata in Hindi video
- TOC#31 | What is CFG | Context Free Grammar | Theory of computation in Hindi video
- TOC#32 | Construct CFG for language having any number of a | Context Free Grammar in Hindi video
- TOC#33 | Derivation Tree, left most, right most, solved examples | TOC in Hindi video
- TOC#35 | Derivation from Grammar examples in TOC in hindi video
- TOC#36 | Ambiguity in Grammar examples 01 | CFG | TOC in Hindi video
- TOC#37 | Ambiguity in Grammar Solved Examples 02 | CFG in Hindi video
- TOC#38 | Ambiguity in Grammar Solved Examples 03 | CFG | TOC in Hindi video
- TOC#39 | Equivalent Grammar Solved Examples in TOC in Hindi video
- TOC#40 | Equivalent grammar solved examples 02 in TOC in Hindi video
- TOC#41 | Chomsky’s Normal Form (CNF) in Hindi video
- TOC#42 | CFG to CNF Conversion in TOC in Hindi video
- TOC#43 | CFG to CNF coversion solved example in Hindi video | TOC
- TOC#44 | Grammar to CNF conversion solved examples in Hindi video | TOC
- TOC#45 | GREIBACH NORMAL FORM (GNF) in TOC in Hindi video
- TOC#46 | Simplify the grammar, removal of null production with solved examples | TOC in Hindi video
- TOC#47 | Convert CFG to LMD, RMD, Parse tree with solved examples in Hindi video | TOC
- TOC#48 | Convert CFG Grammar to NFA to DFA | TOC in Hindi video
- TOC#49 | Pushdown Automata explained, PDA Examples in Hindi video | TOC
- TOC#50 | Difference between Regular Grammar regular expression repression regular languages in TOC in Hindi video
- TOC#51 | JFLAP | TOC in Hindi video
- TOC#52 | Design a Turing machine using JFLAP | TOC in Hindi video
- Design a NFA that accepts the language over the alphabet, Σ= {0, 1,2} where the decimal equivalent of the language is divisible by 3.