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

preview_player
Показать описание
Reduce the dfa using equivalent States of table filling algorithm,minimization of dfa.
#finiteautomata
#toc#reduce dfa
#NDFSMtoDFSM
#minimizationofdfa
#dfaminimizaion
  1. Vijaya Prasad Lectures
  2. Reduce dfa
  3. reduce dfa
  4. minimise dfa
  5. Minimise dfa
  6. minimization dfa
Рекомендации по теме
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)

Minimize the DFA 0:22:24

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

Minimization of DFA 0:15:56

Minimization of DFA (Example 1)

Minimization of DFA 0:11:15

Minimization of DFA (Example 2)

Minimization of Finite 0:38:21

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

9. DFA Minimization 0:11:43

9. DFA Minimization using Table filling method

Lec-26: Minimization of 0:17:36

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

Theory of Computation: 0:16:20

Theory of Computation: Minimized DFA

TOC part 20 0:12:36

TOC part 20 - Minimization of DFA in Tamil

Minimization of DFA 0:09:08

Minimization of DFA (With Multiple Final States)

Table filling method 0:11:13

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

Theory of computation 0:10:16

Theory of computation : minimization of DFA

Table filling method 0:13:32

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

FLAT | Minimization 0:22:37

FLAT | Minimization of DFA using Table Filling Method Session 6

Minimization of DFA 0:13:23

Minimization of DFA using Myhill Nerode Theorem by Bharathi Patnala

Table Filling Method 0:23:23

Table Filling Method in Hindi | Myhill Nerode Theorem | TOC | By- Harendra Sharma

Minimize the DFA 0:39:00

Minimize the DFA using table filling algorithm|equivalence of states|Lec-24| VTU syllabus module - 2

Minimization of DFA 0:09:23

Minimization of DFA ( table filling method)

MINIMIZATION OF DFA 0:19:28

MINIMIZATION OF DFA WITH EXAMPLE IN AUTOMATA THEORY || DFA MINIMIZATION || TOC

Minimization of DFA 0:16:11

Minimization of DFA (Using Transition Table) | For GATE, NET and Other Competitive Exams...

Minimization of DFA 0:08:10

Minimization of DFA using Myhill Nerode theorem with Example2

Dfa minimization|Dfa minimization 0:10:57

Dfa minimization|Dfa minimization using equivalence theorem|Minimization of dfa|Minimize a dfa

#6 Minimization OF 0:21:10

#6 Minimization OF DFA Using Table Filling Method

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

Nice explanation ma'am thank you for clearing my confusion for why we should mark AG also, if child is marked mark parent also

knightkid.yt.
Автор

Thank you ma'am...its really understandable 👍👍

deekshashetty
Автор

Same as my textbook thanks a lot mam 🙏🏻

solutionhub
Автор

Mam it is wrong because here D is not reachable that's why we eliminate state D 👍

Kirange-ilie
Автор

Mam D is a unreachable state so why didn't you remove it

godmangaming
Автор

Not able to understand indistinct and distinct state
final and non final state tick mark of AE and BH
Final and non final state of tick mark AG BG its confusing

azmathullakhan