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

preview_player
Показать описание
dfa examples in theory of automata
Рекомендации по теме
Комментарии
Автор

Sis..I have a doubt.. mostly we have follow from start to another state for check other possibilities are accepted r not??then why you are take from final state to previous state like 'aab' don't we consider to inital state??

Ishu_off
Автор

Construct NFA with E which accepts a language Consisting the strings of any numb of o's followed by any number of 1'sfollowed by any number 2's, Also convert into witn E hansition.Explain this pbm

nagamani
Автор

Bhanu, the explanation was not suitable on this video, please make the explanation more clearly and upload as soon as possible.
.

okikayastha
Автор

Thank you so much mam
I will pray for you mam to jesus
Once again thank you mam

xerlefl
Автор

for bbaab we can directly start from qo, i think we dont ni b from q2

CARsZONE
Автор

Mam in case of bbaab either we are taking q2 as initial state as well as final state???

kiranmourya
Автор

can we take q2 to q1 b and q2 to q0 a?

bfvfsrp
Автор

Mam suppose we take self loop for final state as (a, b) then it end with ab the condition is satisfied..

KLokeshChandra
Автор

I have one doubt in this question: if string need to start from a and end with b then there can any letter with a and b. there are chances that at end the string form like aaabbb then in that case what is the transition graph . There can be n no of b letter used in the string. How can string cannot accept the string having b letter thrice or twice times in a string

_priyanshipandey
Автор

We can put self loop for q2 as a, b then it is also accepted

sriramthorpunuri
Автор

good explanation.
After watching this now I am able to construct DFA.
Thanks

mohammedsohilshaikh
Автор

thank you very much for this great video maam

yousefderhem
Автор

understand the basic first before proceeding

bernetsubo
Автор

Why do you need to add 1 for the number of participating state ? is it because of state 0 ?

chooyinkeat
Автор

Mam multiple path can be possible for one state but u r saying only only one path is possible

yashdubey
Автор

what about trapping states, problem is easy but it becomes difficult when we have to make trapping states.

deepvoyager
Автор

Mam why did you take aab form q1 according to DFA rules the string starts from intital state q0 but it starts from q1 why can u explain please

Divya-kido
Автор

Can't we just push any string over b, a at q2 to a trap state, can't that be possible, please reply me

josephmendes
Автор

Mam if i give a, b loop at final state(q2) is it correct mam???

seumamaheswari
Автор

please can you explain why u take input from the final state

pulkitsrivastava