5.15 Important PYQs on Regular Expressions to Finite Automata | Theory of Computation | Automata

[@KNOWLEDGEGATE_kg]

For complete Theory of Computation, check out this video: kzbin.info/www/bejne/b5zYqqF-mLJmi6M

[@shubhamkandpal27]

The quality of the questions is such that it makes the concept to reach at a firm level, where you can not only understand yourself but also make others also understand.

[@KNOWLEDGEGATE_kg]

Glad to hear that dear @Shubham❤Keep learning & supporting! Stay connected for more amazing contents & informative videos 👍 You can also check out our complete course on all computer science subjects, sharing the link below: www.knowledgegate.in/learn/Zero-to-Hero-in-Computer-Science

[@ritikarathi9487]

Option c is correct

[@anweshamondal4004]

Respected sir, in the second question according to the RE we got minimum 3 states in the FA,but just after that in next question we are calculating that minimum no of states is 2^2=4.Sir shouldn't it be the same case with the previous one?

[@tannuchauhan326]

Option C is correct.

[@HARSH-uh9nc]

Homework question:- option C

[@saraswathikurri1568]

Option C

[@eternal_libation_18]

Option : C

[@opkarmayt7332]

sir 10:15 me L’ ka MIN no. of states poocha h aapne L ka no. of states bataya h

[@believer21259]

Yes it's asked for L' but the answer will be same since the dfa for L' will be same with only change is that all non-final states becomes final and final state will become non-final. But the number of states in DFA of L' is same.

[@Redhuji653]

Option c correct

[@nadeemmehraj5873]

Opetion c

[@hariomgautam882]

option c is answer

[@shovonmondal1992]

option c

[@anindyasundarlayek9686]

sir, in 5.25 ,i can take q1 as the final state with a loop a,b on it, so there will be 2 state. am i correct?

[@aakashgupta6488]

In the given expression we need atleast two elements for the string to be accepted.(b and (a+b)) So a single state wont be sufficient to represent the expression.

[@lakshsinghania]

sir for the first qs @3:58 this is also a correct regular exp for the machine a(b* + (ba)*)* + b(a* + (ab)*)* am i correct ?

[@KNOWLEDGEGATE_kg]

Dear @Laksh, the answer and this regular expression are both equivalent. The main difference is in how they structure the concatenation and alternation of 'a's and 'b's.

[@AashikaKumari-s4j]

option C

[@Pacific_Toofan]

Option c

[@pranavpatel5216]

c

[@bluebone2211]

C 🐙

[@devanarayanababu1996]

7 year old gold

[@prajwalsontakke572]

Opt c

[@shuvam8246]

HW:3

[@gauravkamal8375]

c and d is ans

[@manojkumarsingh4371]

option c