TOC#18 | Draw a NFA and DFA for the language accepting strings ending with ‘aa’ in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#17 | Design a Finite Automata which accepts set of strings containing four 1’s | Theory of computation December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#16 | Construct a finite automata for language {0n | n mod 3 = 2, n ≥ 0} | TOC in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#15 | Design a NFA for {c b a bn } | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#14 | Draw a NFA for strings starting with ‘ab’ | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#13 | NFA accepting strings starting with a | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#12 | Minimization of DFA | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#11 | DFA for the language {w/w contains the substring abab} | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#10 | Draw a DFA ending with ‘abb’ | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
TOC#09 | Draw a DFA ending with ‘ab’ | Theory of computation in Hindi video December 3, 2023March 31, 2022 by Team EasyExamNotes
Team EasyExamNotes