9. DFA Minimization using Table filling method

preview_player
Показать описание
Watch Formal Languages & Automata theory videos in following link..

Technical lectures by Shravan Kumar Manthri.
Watch Top 100 C MCQ's

Watch Technical C programming

Watch Data Warehousing & Data Mining

Watch Design & Analysis of Algorithms

Watch Formal Languages & Automata theory

Like us on fb: CSE GURUS

This video explains DFA Minimization using Table filling method. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS
  1. CSE GURUS
  2. DFA Problems with clear explanation
  3. theory of computation
  4. flat lectures by ravindrababu ravula
  5. flat subject in computer science in telugu
  6. top 100 mcqs in c
Рекомендации по теме
9. DFA Minimization 0:11:43

9. DFA Minimization using Table filling method

Myhill Nerode Theorem 0:19:40

Myhill Nerode Theorem - Table Filling Method

Myhill Nerode Theorem 0:15:05

Myhill Nerode Theorem - Table Filling Method (Example)

Minimization of Finite 0:38:21

Minimization of Finite Automata || Equivalence |Partition || Table Filling |Myhill Nerode |DFA | NFA

DFA Minimization Algorithm 0:21:12

DFA Minimization Algorithm + Example

DFA Minimization Using 0:26:24

DFA Minimization Using Table Filling Method/ Myhill Nerod Theorem with Example | Automata Theory

Minimize the DFA 0:22:24

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

Automata Table of 0:10:32

Automata Table of Distinguishability

Theory of Computation: 0:16:20

Theory of Computation: Minimized DFA

DFA Minimization using 0:14:50

DFA Minimization using Table Filling method

dfa example with 0:04:44

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

Minimization of DFA 0:15:52

Minimization of DFA | Minimization of dfa using table filling method | Myhill Nerode Algorithm | TOC

8. DFA Minimization 0:13:02

8. DFA Minimization using Equivalence method

DFA Minimization Using 0:21:51

DFA Minimization Using Table Filling Method/ Myhill Nerod Theorem | Automata Theory

Table filling method 0:13:32

Table filling method | Myhill-Nerode Theorem | Minimization of DFA | Solved example-3

Minimization of DFA 0:11:15

Minimization of DFA (Example 2)

Minimization of DFA 0:09:08

Minimization of DFA (With Multiple Final States)

DFA minimization using 0:18:26

DFA minimization using table filling of Myhill-Nerode Theorem

Minimization of DFA 0:08:10

Minimization of DFA using Myhill Nerode theorem with Example2

Table filling method 0:11:13

Table filling method | Myhill-Nerode Theorem | Minimization of DFA | Basics | Solved example-1

Minimization of DFA 0:13:23

Minimization of DFA using Myhill Nerode Theorem by Bharathi Patnala

NFA To DFA 0:07:08

NFA To DFA Conversion Using Epsilon Closure

Lec-26: Minimization of 0:17:36

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

DFA Minimization via 0:40:40

DFA Minimization via Table filling Algorithm & Closure Property

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

This one lecture gave the satisfaction of my classes for my 6 months durationed semester...U nailed it my dear brother 🔥🔥kudos...love from Guntur (Andhra Pradesh)

ramanji
Автор

Sir some question there are number of non reachable states but in answer they are take all states they don't remove non reachable states in table filling method, so how can i do that problem

spandanapolana
Автор

Sir, what if the transaction table has two different rows then it would be hard to find right

nikhilbommakanti
Автор

No unmarkable pairs for some example then last what to do

abhilashmaram
Автор

Really helpful explanation, thank you

prashantsaroj
Автор

yoo bro who got you smilin like that like that happy

hadihamdan
Автор

i think there is an error at q1, q2 . we should check q3 q2 and not q2 q3

DivertissementbyTag
Автор

How to make transition table of more than 3 inputs

mehrajulasrar
Автор

You skipped How to find final&non final steps

suprithrasineni
Автор

absolutely unclear, getting lost very quick

antonfrombutovo