Practice Theory of Computation - GATE - CSIT, DSAI & Interview Preparation Offered by Unacademy

SELF STUDY

Browse Practice Tests Playlist Doubts & solutions Free live classes Other courses

Theory of Computation

Quick practice

Question 1 of 5

Let $L_{1}$ = {w| w has at least four a’s} and $L_{2}$ = {w | w has at most two a’s}. $L_{1}$ ⋂ $L_{2}$ will yield the language

A

{w | w does not have exactly 3 a’s}

B

Φ

C

{w | w has at least 2 a’s}

D

{w | w has exactly 3 a’s}