2,176 views
4 4 votes

Which of the following is not regular?

(A). {a^{4n}/n>=0 and input alphabet is {a,b}}       

(B). a^{i}b^{j}c^{k} where i+j+k>100 & k>50

(C). a^{i}b^{j}c^{k} where i+j+k>100 & j+k>50                  

(D). None of the above

1 Answer

Best answer
7 7 votes

1. a4n/n>=0 = {a, aaaa,aaaaaaa,aaaaaaaaaaa ....} generated by (a4)* . So Regular 

2. a^{i}b^{j}c^{k} where i+j+k>100 & k>50 =  Regular restriction length should be atleast 101 in which c should be atleast 51.

3. a^{i}b^{j}c^{k} where i+j+k>100 & j+k>50 = Regular length sholud be ateast 101 and where Band c sum should be atleast 51.

D will be answer

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. a^{i}b^{j}c^{k} where i+j - k>100 & k>50  then non regular 

2. a^{i}b^{j}c^{k} where i- j+k>100 & j+k>50 then non regular.

• selected by
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
2.2k
2.2k views
Anmol Verma asked Dec 1, 2016
2,183 views
Construct right-linear grammar and left-linear grammar for the languageL ={anbm : n$\geq$2 , m$\geq$3}Explanation about this....???
3 3 votes
2 2 answers
2.1k
2.1k views
Shreya Roy asked Nov 18, 2016
2,089 views
Let L = {xy | xwy L1, |x| = |w| = |y|}. Then L is(L1 is regular)(A). Regular(B). Non regular(C). May be regular(D). None
3 3 votes
1 1 answer
1.6k
1.6k views
Kapil asked Nov 9, 2016
1,575 views
Consider languages L1 and L2 over {0,1} alphabet . L2= { w | w contains some x as a substring and x belongs to L1 }Which of the following m...
5 5 votes
1 answers 1 answer
2.1k
2.1k views
KISHALAY DAS asked Nov 7, 2016
2,132 views
L is a language in which number of b's is twice the number of a's. M is a language in which every 'a' is being followed by exactly 2b's. N is a language in which all a’s ...