Finite Automata Decision Properties in Hindi 📘

Lec-25 Decision Properties of Finite Automata(In Hindi)
Learn basic concepts of DFA design in HINDI language.
Theory of Computation
Automata Theory
Sangadak Gyaan

Please Also watch
lec 24 Epsilon NFA to NFA conversion part 2
https://youtu.be/NjGaBs57gA0
Lec-23 How to convert NFA with epsilon moves to NFA (In Hindi)
https://youtu.be/-rHyL1mPzuI
Lec-22 NFA with epsilon moves (In Hindi)
https://youtu.be/rz9zlT4z1mw
Lec-21 Converting NFA to DFA(In Hindi)
https://youtu.be/-vokHI8pOT8
Lec-20 Introduction to Non-Deterministic Finite Automata NFA (in hindi)
https://youtu.be/mdOgDpRJNVo
Lec-19 DFA Complementation(In Hindi)
https://youtu.be/F3aQRj19Ju8
Lec 18 DFA Assignment
https://youtu.be/QcJxXeqrT24
Lec-17 How many maximum number of DFAs can be constructed with states x and y over the input alphabet {0,1}.
https://youtu.be/4XI64zvOaDA
Lec-16 DFA Minimization Gate Questions(In Hindi)
https://youtu.be/t2XR3Ft-1gY

Lec-15 How to minimize DFA in theory of Computation(In Hindi)
https://youtu.be/yeIs-yUFwKA
Lec-14 How to design DFA that accepts all string having 001 as a substring
https://youtu.be/dA8KVs_mH7Q
Lec-13 How to design DFA that accepts all binary strings divisible by 2(In Hindi)
https://youtu.be/w6oRpxaevbM
Lecture-12 Deterministic vs Non-deterministic Machines in Theory of Computation
https://youtu.be/ZWRCu7BRgP4
Lec-11 Regular Language | CFL | Various Type of Languages in TOC(In Hindi)
https://www.youtube.com/watch?v=7qoLHBQZaes&t=23s
Lec-10 How to Design DFA, accepting all strings where last 2 symbols are same(In Hindi)
https://www.youtube.com/watch?v=US2IOF4h0M4
Lec-9 How to Design DFA, accepting all strings where first 2 symbols are same(In Hindi)
https://youtu.be/MeFgHWAqWR0
Lec-8 How to Design DFA, accepting all strings starting and ending with same symbols(In Hindi)
https://youtu.be/n4EPfpIlyuA
Lec-7 How to Design DFA, accepting all strings starting and ending with Different symbols(In Hindi)
https://youtu.be/KqeanjAulmU
Lec-6 How to Design DFA, accepting all strings starting with a and ending with b(In Hindi)
https://youtu.be/zAbPq89Vgjg
Lec-5 How to Design DFA, accepting all strings ending with b
https://youtu.be/NK9LbNoLgMQ
Lec-4 How to Design DFA, accepting all strings starting with a
https://youtu.be/PdHA6zDLyyQ
Lec 3-DFA Practice Session 2MCQ on DFA, for GATE/BTECH/MCA and also for NET/PSU(In Hindi)
https://www.youtube.com/watch?v=UbkcN3Srl-0&t=44s
Lecture-2 DFA Practice Session-1, MCQ on Deterministic Finite Automata, FOR B.tech. or MCA and also for GATE/NET/PSU(In Hindi)
https://www.youtube.com/watch?v=Syr9EUmR9P4
and Lecture-1 Definitions and Introduction
https://www.youtube.com/watch?v=NXM_LmKNwjo