⊕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

None of these

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

None of these

Q has to be regular

Q cannot be regular

Q need not be regular

Q cannot be a CFL

union and complementation has to be closed under intersection

intersection and complement has to be closed under union

union and intersection has to be closed under complementation

both 1) union and complementation has to be closed under intersection and 2) intersection and complement has to be closed under union