Conversion of epsilon NFA to DFA (ENFSM to DFSM) example 1|Lec-22, Automata Theory

preview_player
Показать описание
This video explains ,conversion of epsilon -NFA to DFA,epsilon non deterministic finite state machines to deterministic finite state machines.
Рекомендации по теме
Комментарии
Автор

Day after tomorrow is my exam mam thank you mam for your explanation 😁

daraneshkumars
Автор

how d contain 9 state we can not take free ride upto the 9 state from 3, 4, 5, 6, 7, 8 we can only take if we see and check epsilon on state 2 then it is possible to get 9 state

naeemrehman