The Gateway to Computer Science Excellence
0 votes

Given answer is option c. Can anyone tell me how? 

in Theory of Computation by (187 points)
edited by | 242 views
can you please type the question instead of screenshot !
But why? I think putting an image is more efficient than writing the question,as it is less prone to human errors. What problem do you have with it?

this site has more number of questions, and all the test series and work book questions have high probability to be asked previously, then how one can find duplicates?


as it is less prone to human errors

as per my knowledge, typing a small question doesn't effect this much !!

I have checked and didn't find any duplicate, that's why posted the question.
And next time when someone else asks the same questions they will also not find since you've uploaded image instead of typing the question . I too used to do the same but it's better for the community if you can type questions

OK @shaz

2 Answers

+2 votes
Best answer

C is the right answer.

 The  language L=(a+$\epsilon$)(bb*a)* can not produce b, bb

option a)  It says language L must contain all strings that does not have aa as substring so string b should be in L.

option b) It says no two consecutive a's again failed due to above string.

option c) This is is correct because L contains all strings that does not end with b and does not contain two or more consecutive a's.

by (117 points)
selected by
0 votes

You can try generating the strings first and see the pattern and eliminate the options.

The regular expression has the language L = { ε , a,ba,bba, aba, abba...}

You can see that we can't get the string "abab" using this, this alone eliminates options A and B.

And thus by generating more strings you can see that the correct option is indeed C. 

by (369 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,242 answers
104,603 users