TOC | TAFL | Automata | Theory Of Computation | Theory of Automata |Theory of Automata and Formal Languages| Aktu tafl (Hindi) (Part 1)

     
Starting a new Lecture Notes Series on TOC | TAFL | Automata | Theory Of Computation | Theory of Automata |Theory of Automata and Formal Languages| Aktu tafl


Youtube Lecture Playlist Credits 
Channel Name: FISTS Academy

So Let Us Start to This Journey of Learning 
TOC | TAFL | Automata | Theory Of Computation | Theory of Automata |Theory of Automata and Formal Languages| Aktu tafl By Lecture Notes together!


Lecture 1: Lec 1 | Introduction to TOC | TAFL | Theory Of Computation | Automata | @fistsAcademy
Lecture 2: Lec 2 | Symbol | Alphabet | String | Language | ε | λ | TOC | Theory of Computation |@fistsAcademy
Lecture 3: Lec 3 | Power of Σ (Alphabet) | ∑ | ∑* | ∑+ | Sigma | Automata |toc |tafl| alphabet | @fistsAcademy
Lecture 4: Lec 4 | Language in TOC | Concatenation of Languages | @fistsAcademy
Lecture 5: Lec 5 | Automata | Finite Automata | @fistsAcademy
Lecture 6: Lec 6 | DFA - Deterministic Finite Automata | DFA | Finite Automata | TOC | TAFL |@fistsAcademy
Lecture 7: Lec 7 | DFA Ex 1| Construct a DFA for Set of Strings containing a | Finite Automata| @fistsAcademy
Lecture 8: Lec 8 | DFA Ex 2|Set of Strings Starts with a |Set of Strings ends with a |Design DFA |@fistsAcademy
Lecture 9: Lec 9 | DFA Design Ex 3 |Set of Strings Ends with abb| Deterministic Finite Automata | @fistsAcademy
Lecture 10: Lec 10 | DFA Design Ex 4|Set of Strings of Length 2 over {a,b}|Deterministic Finite Automata|
Lecture 11: Lec 11 | DFA Design Ex 5 | Set of Strings starts with a and ends with b | @fistsAcademy
Lecture 12: Lec 12 | DFA Design Ex 6 | Set of Strings with 2nd symbol from LHS as a | @fistsAcademy
Lecture 13: Lec 13 | DFA Design Ex 7 | Set of Strings for length mod 2 and mod 3 scenarios | @fistsAcademy
Lecture 14: Lec 14 | DFA Design Ex 8 | Set of Binary Strings whose Decimal value % 2 = 0 | @fistsAcademy
Lecture 15: Lec 15 | DFA Design Ex 9 |Set of Binary/Ternary Strings whose Decimal value % 3/4 = 0| @fistsAcademy
Lecture 16: Lec 16 | DFA Design Ex 10 | For Language L of pattern a^n b^m | @fistsAcademy
Lecture 17: Lec 17 | DFA Design Ex 11 | Set of Strings where A's%2=0, A's%2=1, B's%2=0, A's%3=0 | @fistsAcademy
Lecture 18: Lec 18 | DFA Design Ex 12 | Set of Strings where A's%2=0 and B's%2=0 | @fistsAcademy
Lecture 19: Lec 19 | DFA Design Ex 13 | Set of Strings where A's%2=0 and B's%3=0 | @fistsAcademy
Lecture 20: Lec 20 | DFA Design Ex 14 | Set of Strings where A's%3=0 and B's%3=0 | @fistsAcademy
Lecture 21: Lec 21 | Non Deterministic Finite Automata (NFA) | NFA DEFINITION |@fistsAcademy
Lecture 22: Lec 22 | NFA Design Ex 1 | Set of Strings which starts/end with A/ABB, contains A | @fistsAcademy
Lecture 23: Lec 23 | NFA Design Ex 2 | Set of Strings where 2nd symbol from LHS/RHS is A | @fistsAcademy
Lecture 24: Lec 24 | Conversion from NFA to DFA | NFA to DFA | @fistsAcademy
Lecture 25: Lec 25 | NFA to DFA Design Ex 1 | @fistsAcademy
Lecture 26: Lec 26 | NFA to DFA Design Ex 2 | Set of Strings where 3rd symbol from RHS is A | @fistsAcademy
Lecture 27: Lec 27 | Epsilon NFA (Non Deterministic Finite Automata with accepts epsilon) | @fistsAcademy
Lecture 28: Lec 28 | Minimization of DFA (Deterministic Finite Automata) | @fistsAcademy
Lecture 29: Lec 29 | Minimizing DFA Design Example | @fistsAcademy
Lecture 30: Lec 30 | Moore Machine | FA with Output | @fistsAcademy
Lecture 31: Lec 31 | Moore Design Example | Machine that prints 1 for every occurrence of ab | @fistsAcademy
Lecture 32: Lec 32 | Mealy Machine | FA with output | @fistsAcademy
Lecture 33: Lec 33 | Mealy Design Example | M/C for 1's complement, 2's complement, Binary Adder| @fistsAcademy
Lecture 34: Lec 34 | Moore to Mealy Conversion Design Example 1 | @fistsAcademy
Lecture 35: Lec 35 | Moore to Mealy Conversion Design Example 2 | @fistsAcademy
Lecture 36: Lec 36 | Mealy to Moore Conversion Design Example 1 | @fistsAcademy
Lecture 37: Lec 37 | Mealy to Moore Conversion Design Example 2 | @fistsAcademy
Lecture 38: Lec 38 | Regular Expression | @fistsAcademy
Lecture 39: Lec 39 | Construct Regular Expression Examples - 1 | Regular Expression | @fistsAcademy​
Lecture 40: Lec 40 | Construct Regular Expression Examples - 2 | Regular Expression | @fistsAcademy ​
Lecture 41: Lec 41 | Construct Regular Expression Examples - 3 | Regular Expression | @fistsAcademy ​
Lecture 42: Lec 42 | Construct Regular Expression Examples - 4 | Regular Expression | @fistsAcademy ​
Lecture 43: Lec 43 | Identity Rules of Regular Expression | Regular Expression | @fistsAcademy
Lecture 44: Lec 44 | Kleene's Theorem | Regular Expression | @fistsAcademy
Lecture 45: Lec 45 | Thompson Algorithm (R.E. to F.A.)| Regular Expression |TOC |TAFL |Automata | @fistsAcademy
Lecture 46: Lec 46 | Arden's Theorem (F.A. to R.E.) | Regular Expression | @fistsAcademy
Lecture 47: Arden's Proof Explanation | Regular Expression | @fistsAcademy
Lecture 48: Lec 47 | Arden's Theorem Ex-1 | Examples with one final state | @fistsAcademy
Lecture 49: Lec 48 | Arden's Theorem Ex-2 | Examples with more than one final state | @fistsAcademy
Lecture 50: Lec 49 | Arden's Theorem Ex-3 | FA to RE | Regular Expression | @fistsAcademy
Lecture 51: Lec 50 | State Elimination Method (F.A to R.E) | Regular Expression | @fistsAcademy
Pinterest
More
Less
Tumblr
Mix
GMail
LinkedIn
Reddit
XING
WhatsApp
Hacker News
VK
Telegram
Line
Related Posts