নির্দিষ্ট অটোমাটা (NFA) এর উদাহরণ | তত্ত্ব ও কম্পিউটেশনের ব্যাখ্যা 📚

TOC 1 : Introduction to TOC
TOC 2 : Finite Automata
TOC 3 : Introduction to DFA
TOC 4 : DFA of string which starts with 'a'
TOC 5 : DFA of string which starts with 'aa'
TOC 6 : DFA of string which starts with "aab"
TOC 7 : DFA of string which starts with "10"
TOC 8 : DFA of string which contains 'a'
TOC 9 : DFA of string which ends with 'a'
TOC 10 : DFA of string which ends with "ab"
TOC 11 : Starting and ending with different symbol
TOC 12 : Starting and ending with same symbol
TOC 13 : Construct DFA that contains 'ab'
TOC 14 : Construct a DFA where the length of each string is 4
TOC 15 : Construct DFA that has an odd number of a's
TOC 16 : Construct DFA that has an odd number of a's and ends with b
TOC 17 : DFA minimization
TOC 18 : Minimization of DFA Example: 1
TOC 19 : Minimization of DFA Example: 2
TOC 20 : Minimization of DFA Example: 3
TOC 21 : Introduction to NFA
TOC 22 : Examples of NFA
TOC 23 : NFA to DFA conversion 1
TOC 24 : NFA to DFA conversion 2

#StickyNotesEngg #Theory_of_Computation #StickyNotesTOC