775 views
0 votes
0 votes

L1={w|starts with a and ends with b}

L2={w|starts with b and ends with a}

then L1 ⋂ L2 will be:
1. Finite
2.CFL but not regular
3.none of the above.

3 Answers

Best answer
4 votes
4 votes
I tried in this way.

All strings in L1 start with a while strings in L2 start with b. So their intersection will be EMPTY.

Answer,= Finite :)
selected by
0 votes
0 votes
L1 is regular so finite

L2 is also regular so finite

regular lang are closed under intersection

so finite
0 votes
0 votes
L1 always starts with 'a'  and L2 always starts with 'b'

So the intersection will be € ie empty string

€ is a finite set

So option 1. Finite set is correct
edited by

No related questions found