Test: Egular Grammar - Computer Science Engineering (CSE) MCQ

7

10

12

11

(01)*0 = 0(10)*

(0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*

(0+1)*01(0+1)*+1*0* = (0+1)*

All of the mentioned

Accepted by DFA

Accepted by PDA

Accepted by LBA

Accepted by Turing machine

Context free grammar

Non context free grammar

English grammar

None of the mentioned

[(a+b)*-(aa+bb)]*

[(0+1)-(0b+a1)*(a+b)]*

(01+11+10)*

(1+2+0)*(1+2)*

Type 0 language

Type 1 language

Type 2 language

Type 3 language

All subsets of a regular set are always regular

All finite subsets of non-regular set are always regular

Union of two non regular set of language is not regular

Infinite times union of finite set is always regular

Regular

Context free

Context sensitive

Recursive

Union

Intersection

Kleene star

All of the mentioned

L = {aaaa,aabb,bbaa,bbbb}

L = {abab,abaa,aaab,baaa}

L = {aaab,baba,bbaa,bbbb}

L = {aaaa,abab,bbaa,aaab}

{S->aSbb,S->abb}

{S->aSb, S->b}

{S->aA,S->b,A->b}

None of the mentioned

R1 UNION R2 is regular

R1 INTERSECTION R2 is regular

∑ INTERSECTION R2 IS NOT REGULAR

R2* IS NOT REGULAR

aaabbbbbb

aabbb

abbabbba

aaaabbbabb

{S->bS, S->b,S->aA, S->bA, A->aB, B->bB, B->aS, S->a}

{S->aS,S->bA,A->bB,B->bBa,B->bB}

{S->aaS,S->bbA,A->bB,B->ba}

None of the mentioned

type-3 grammar

type-2 grammar

type-1 grammar

type-0 grammar