4.5. DFA for strings starts with abb

[@okey5211]

Sir,in previous video u put qo.but here u use q€.y sir🤔

[@Sweety40500]

Sir if i do like this in exam, can i get marks for this?? By applying this logic

[@DarkerthantheN]

Thank you so much sir 👍

[@koushik6934]

What is the solution for, if it is not starting with "abb"? Can trap state be Final state?
HELP!!

[@mosesimmanuel9841]

If both starts and end s give what should we do

[@oviyayuki817]

In previous video , u put qo instead of q€.... Y is it so...

[@oviyayuki817]

Can't we put here qo... And can't we use q€ thr?

[@dxatta4908]

please solve . what is the solution of this problem .Q1 ( construct DFA Start with ab and ending with a. )
i will be thank full to you if you solve this issue for me.

[@neil9901]

Very good video sir

[@CSEGURUS]

Thank you. Keep Learning.

[@utkarshp1108]

You are saving my toc exam

[@CSEGURUS]

Glad to hear...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?

[@love.c9701]

please answer the below question

[@CSEGURUS]

Please mention the comment in the video that u have a doubt..

[@ETVlogs154]

Super explanation

[@CSEGURUS]

Thank you.. Keep learning..
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421#overview

[@tlasyashree7590]

DFA which accepts strings having at most one pair of consecutive as and at most one pair of consecutive bs