TOC Lec 14 - minimization of DFA by Deeba Kannan

preview_player
Показать описание
TOC Lec 14 - Minimization of DFA by Deeba Kannan
  1. DEEBA KANNAN
  2. Minimization of DFA by Deeba Kannan
  3. DFA
  4. TOC
  5. Deeba Kannan
  6. Minimization of DEF
Рекомендации по теме
TOC Lec 14 0:17:10

TOC Lec 14 - minimization of DFA by Deeba Kannan

Minimization of Deterministic 0:06:10

Minimization of Deterministic Finite Automata (DFA)

Lec-26: Minimization of 0:17:36

Lec-26: Minimization of DFA in Hindi with example | TOC

Minimization of DFA 0:15:56

Minimization of DFA (Example 1)

Lec-14: DFA vs 0:07:57

Lec-14: DFA vs NFA in TOC in Hindi with examples | Must Watch

minimization of DFA 0:10:18

minimization of DFA example | TOC | Lec-24| Bhanu Priya

NFA example | 0:07:26

NFA example | Part-1 | TOC | Lec-14 | Bhanu Priya

minimization of DFA 0:06:33

minimization of DFA | TOC | Lec-23| Bhanu Priya

dfa example with 0:04:44

dfa example with solution | Part-3 | TOC | Lec-12 | Bhanu Priya

Minimization of DFA 0:09:08

Minimization of DFA (With Multiple Final States)

TOC | Minimization 0:17:20

TOC | Minimization of DFA | Ravindrababu Ravula | Free GATE CS Classes

Lec-14: Minimization of 0:14:04

Lec-14: Minimization of DFA| Easily understand each steps(EX2)

Minimization of DFA 0:11:15

Minimization of DFA (Example 2)

Myhill Nerode Theorem 0:19:40

Myhill Nerode Theorem - Table Filling Method

Minimize the DFA 0:22:24

Minimize the DFA using table filling algorithm|Lec-12|ATC VTU syllabus module - 1,myhill nerode meth

Lec-12: DFA of 0:07:26

Lec-12: DFA of all binary strings divisible by 3 | DFA Example 5

Lec-33: Reversal Operation 0:06:28

Lec-33: Reversal Operation in toc | How regular languages closured under reversal

Lec-7: DFA Example 0:08:12

Lec-7: DFA Example 1 | How to Construct DFA in TOC

Theory of Computation: 0:16:20

Theory of Computation: Minimized DFA

Lec-47: What is 0:07:57

Lec-47: What is Context free grammar in TOC | Formal Definition

Lec-55: Remove Unit 0:07:10

Lec-55: Remove Unit Production from CFG(Context Free Grammar) in Hindi

Lecture 16: Minimization 0:22:25

Lecture 16: Minimization of DFA

17) DFA MINIMISATION- 0:10:31

17) DFA MINIMISATION- Equivalence Method Eg:01 #toc Lecture 17

TOC Lec 17 0:17:30

TOC Lec 17 - DFA to Regular expression by Deeba Kannan

Комментарии
Автор

Is it correct to proceed without eliminating D...because the end diagram seems to be almost similar...either we get D or F atlast

joshyjolly
Автор

Your knowledge as well as teaching skills is really very good.
If possible, please upload a video on pumping lemma for regular language and cfl.

studdstar
Автор

i am little confused At final minimizing F goes to C when 0 called & F goes to G when 1 called...please check it...don't mind mam....

Bhriti_Mondal
Автор

The combination f, d also exists...bcoz they r equal in transition func....what's the need for removing D in initial?

akashraj.srinivasan
Автор

itna achha padhati ho ji vo bhi free me, tumko 5 crore ka package milna chahiye

m.k.gvideo
Автор

i think something go wrong in this bca you r not shows b state in your tranjection
table

nehathakur
Автор

dear mam plz send me Minimization of DFA Algoritham, C++ or C coading i am waiting tour reply thanx

mubeenptcljampur
Автор

mam why did you take only C as final state ?

yagnavalkgoud
Автор

very very very nice teaching style
tumko MIT, IISc, IIT
me hona chahiye pata nhi SRM me kya kr rhi hai

m.k.gvideo