MINIMIZATION OF FINITE AUTOMATA PART 1 AUTOMATA THEORY

preview_player
Показать описание
MINIMIZATION OF FINITE AUTOMATA PART 1 AUTOMATA THEORY
  1. RoyalsDeck
  2. MINIMIZATION
  3. AUTOMATA
Рекомендации по теме
Minimization of DFA 0:15:56

Minimization of DFA (Example 1)

Minimization of Deterministic 0:06:10

Minimization of Deterministic Finite Automata (DFA)

Minimization of DFA 0:11:15

Minimization of DFA (Example 2)

Minimization Of Finite 0:05:53

Minimization Of Finite Automata

Lec-26: Minimization of 0:17:36

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

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

Minimization of DFA 0:09:08

Minimization of DFA (With Multiple Final States)

MINIMIZATION OF FINITE 0:10:00

MINIMIZATION OF FINITE AUTOMATA PART 1 AUTOMATA THEORY

Myhill Nerode Theorem 0:19:40

Myhill Nerode Theorem - Table Filling Method

Minimization of DFA 0:06:33

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

Minimization Of Finite 0:19:02

Minimization Of Finite Automata by Ms. Heena Khanna [Automata]

✍️minimization of DFA 0:01:00

✍️minimization of DFA 🎯 | best trick ever‼️ equivalence 0 1 2 3 | Theory of computation | gate | exm...

8. DFA Minimization 0:13:02

8. DFA Minimization using Equivalence method

MINIMIZATION OF FINITE 0:06:14

MINIMIZATION OF FINITE AUTOMATA PART 2 AUTOMATA THEORY

Theory of Computation: 0:16:20

Theory of Computation: Minimized DFA

Minimization of Finite 0:11:13

Minimization of Finite Automata

Myhill Nerode Theorem 0:15:05

Myhill Nerode Theorem - Table Filling Method (Example)

Minimization of Finite 0:17:29

Minimization of Finite Automata(DFA) using Equivalence or Partition Method || Example 3

38 Minimization of 0:11:53

38 Minimization of finite automata problem

DFA Minimization || 0:13:50

DFA Minimization || Example 1 || Minimization of DFA || GATE CSE || TOC

DFA Minimization 0:06:27

DFA Minimization

Minimization of Finite 0:22:12

Minimization of Finite Automata Part - 1 | Theory of Computation | Complementary Course, Semester 3

MINIMIZATION OF DFA 0:19:28

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

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

This question is taken from"Theory of Computer Science" Automata, Languages and Computation written by K.L.P Mishra and N.Chandrasekaeran Third edition
Chapter 3. Page 95, Example 3.14

lalrinchhanakhalthang
Автор

Explanation is gud but there is a mistake. Anyway, thanks bcz I understood the concept.

shivjeechoudhary
Автор

You need to improve a lot. Mistakes are there.. But i got the concept. Thanks

shalomalexander
Автор

I got the concept thanku ❤ but one mistake is there ... anywz No issue 😍

bhatmehvish
Автор

I like ur explanation but there is one mistake in PIE 1 step but i understood the concept now i can do it

chetanyadav
Автор

its completely mistake because you should remove the unreachable part (q4, q5, q6, q7) are unreachable!
they should be removed.

zuhirbadr
Автор

Your 3rd step is wrong q2 already out in 2nd

bikramjitrajkumar