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.
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
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?
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.
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.
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.
For complete Theory of Computation, check out this video:
th-cam.com/video/9kuynHcM3UA/w-d-xo.html
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.
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
Option c is correct
Option C is correct.
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?
sir 10:15 me L’ ka MIN no. of states poocha h aapne L ka no. of states bataya h
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.
Option C
Homework question:- option C
Option : C
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 ?
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.
Option c correct
Option C is the correct
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?
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.
Opetion c
option c is answer
option c
c
C
🐙
7 year old gold
option C
Option c
Opt c
HW:3
c and d is ans
option c