4.21. DFA for strings of the form a3bwa3

Technical lectures by Shravan Kumar Manthri.
Watch Top 100 C MCQ's
• Top 100 MCQs in C ("Wa...
Watch Technical C programming
• Technical C coding : p...
Watch Data Warehousing & Data Mining
• 1. Multi-Dimensional ...
Watch Design & Analysis of Algorithms
• 1. Introduction to the...
Watch Formal Languages & Automata theory
• 1. Introduction to Aut...
Contact me @ fb : [e-mail]
Like us on fb: CSE GURUS
This video explains DFA problems with explanation. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS

[@hemanthtummala753]

at the last for q7 state self loop with a is wrong as it fails to satisfy the condition a3bwa3

[@CSEGURUS]

Can u give one example?

[@acdb154]

aaabaaaba

[@nithinrajchittath7820]

I think there should be a transition of a,b to the dummy state instead of a self loop with a.

[@satheesh3266]

@@nithinrajchittath7820 no bro the self loop is correct ......if u input a string like aaabbababbbaaaaaaaaaaaaa still it end with 'aaa'. Thats all there is no need to a dummy state from q7

[@nithinrajchittath7820]

@@satheesh3266 now that I think about it yes I think you are right.
Thanks man👍

[@bishopkashyap7153]

Here q6 will be the final state. The solved DFA is for a^3bwa^4.

[@sairamnomula8710]

Isnt this going like a big clumsy chain?
Why dont you use self state for q1?

[@erpritam76]

For the self loop, you will get b after any number of a. Here, b should come after only 3 consecutive a.