context-free ⊂ right-linear ⊂ context-sensitive

context-free ⊂ context-sensitive ⊂ right-linear

context-sensitive ⊂ right-inear ⊂context-free

right-linear ⊂context-free ⊂context-sensitive

.

⊕is left associative while * is right associative

Both⊕ and * are left associative

⊕ is right associative while * is left associative

None of these

2x - 1

2x

2x + I

A = { If an bn | n = 0,1, 2, 3 ..} is regular language

Set B of all strings of equal number of a's and b's defines a regular language

L (A* B*)∩ B gives the set A

Q has to be regular

Q cannot be regular

Q need not be regular

Q cannot be a CFL