Lec-16 DFA Minimization Gate Questions(In Hindi)

Lec-16 DFA Minimization Gate Questions(In Hindi)

Learn basic concepts of DFA design in HINDI language.
Theory of Computation
Automata Theory
Sangadak Gyaan

Please Also watch
Lec-15 How to minimize DFA in theory of Computation(In Hindi)
Lec-14 How to design DFA that accepts all string having 001 as a substring
Lec-13 How to design DFA that accepts all binary strings divisible by 2(In Hindi)
Lecture-12 Deterministic vs Non-deterministic Machines in Theory of Computation
Lec-11 Regular Language | CFL | Various Type of Languages in TOC(In Hindi)
Lec-10 How to Design DFA, accepting all strings where last 2 symbols are same(In Hindi)
Lec-9 How to Design DFA, accepting all strings where first 2 symbols are same(In Hindi)
Lec-8 How to Design DFA, accepting all strings starting and ending with same symbols(In Hindi)
Lec-7 How to Design DFA, accepting all strings starting and ending with Different symbols(In Hindi)
Lec-6 How to Design DFA, accepting all strings starting with a and ending with b(In Hindi)
Lec-5 How to Design DFA, accepting all strings ending with b
Lec-4 How to Design DFA, accepting all strings starting with a
Lec 3-DFA Practice Session 2MCQ on DFA, for GATE/BTECH/MCA and also for NET/PSU(In Hindi)
Lecture-2 DFA Practice Session-1, MCQ on Deterministic Finite Automata, FOR B.tech. or MCA and also for GATE/NET/PSU(In Hindi)
and Lecture-1 Definitions and Introduction

[mayankjha]

Thank you sir you have explained very well🙏