Equivalence of NFA and DFA, Closure properties

preview_player
Показать описание

  1. Theory of Computation
  2. Equivalence
  3. of
  4. NFA
  5. and
  6. DFA
Рекомендации по теме
Conversion of NFA 0:09:28

Conversion of NFA to DFA

Equivalence of Two 0:10:58

Equivalence of Two Finite Automata

Equivalence of NFA 0:33:14

Equivalence of NFA and DFA, Closure properties

Conversion of NFA 0:12:31

Conversion of NFA to DFA (Powerset/Subset Construction Example)

A Quick Non-Deterministic 0:18:55

A Quick Non-Deterministic to Deterministic Finite Automata Conversion

Conversion of NFA 0:09:06

Conversion of NFA to DFA (Example 1)

NFA To DFA 0:07:08

NFA To DFA Conversion Using Epsilon Closure

Equivalence of NFA 0:18:18

Equivalence of NFA and DFA with Example

Equivalence of Two 0:06:02

Equivalence of Two Finite Automata (Example)

Equivalence of NFA 0:13:16

Equivalence of NFA and DFA| Convert NFA to DFA

Converting NFA to 0:15:56

Converting NFA to DFA || Equivalence of DFA and NFA || Theory of Computation || TOC || FLAT

Equivalence of DFA 0:08:51

Equivalence of DFA with examples

tcn lec03: Equivalence 0:21:53

tcn lec03: Equivalence of nfa and dfa

Equivalence of 2 0:06:54

Equivalence of 2 Finite State Machines || Equivalence between Two Finite Automata || DFA || NFA

Conversion of NFA 0:12:01

Conversion of NFA to DFA (Example 2)

Conversion of NFA 0:08:23

Conversion of NFA to DFA examples | Part-1/2 | TOC | Lec-19 | Bhanu Priya

Conversion of NFA 0:07:59

Conversion of NFA to DFA (Example 3)

EQUIVALENCE OF NFA 0:09:11

EQUIVALENCE OF NFA AND DFA -#TOC-15

Tutorial 23 : 0:12:23

Tutorial 23 : Equivalence of DFA and NFA in Hindi by Prateek Jain

Equivalance of NFA 0:14:18

Equivalance of NFA and DFA

Equivalence of two 0:11:05

Equivalence of two Finite Automata | TOC | Lec-21 | Bhanu Priya

UNIT2 LECTURE 15 0:23:31

UNIT2 LECTURE 15 EQUIVALENCE OF NFA AND DFA

CONVERSION OF NFA 0:18:06

CONVERSION OF NFA TO DFA WITH EXAMPLES IN AUTOMATA THEORY || NFA TO DFA CONVERSION || TOC

Lecture 16 Equivalence 0:06:37

Lecture 16 Equivalence of NFA & DFA

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

Definitely, best lectures, some math is missing so that it is graspable to students. I noticed that at 14.09, where e-transitions are taken care, e-closure from q_0, starting state must also be cared. However, I feel that just a small mistake. If you go through Prof. Ullman's lecture, this mistake can be easily rectified.

kapilgupta
Автор

Ravindra sir table method is much more easier to visualize, although I liked your video, it was amazing

SHASHANKRUSTAGII
Автор

sir i have a doubt in construction of nfa for the star operation, i think we have to also cover the case when string is epsilon, as it is present in the star of two languages.

kira-nrqj
Автор

I liked this method but I think chances of doing mistakes is high in this method, but it is less time consuming.

AftabAlam-ddnn
Автор

He made an easy stuff look difficult, If you're a novice in this context it's not recommended at all.. very poor quality of teaching indeed, It doesn't matter how much knowledge you've, at the end of the day all it matters is how easily you can deliver that to others.

lemniscatephile