Register

Practice Question #5

998 views
0 0 votes
Let language L1 = {0,1}* if another language L2 is CFL.

L1 = empty set if another language L2 is not CFL.

L2 = a language the is R.E and its complement is R.E.

What can we say about L1 and L2?

is L1 and L2 are regular, CFL, CSL, R.E or finite or infinite.

1 Answer

0 0 votes

L1 is regular since it can accept any number of 0's and 1's including epsilon

L2 is recurrsive  since L2 and L2'  both are RE

Voting & Accepting an answer helps improve the community
← Previous · Time complexityNext → · hashing
← Previous in category · Practice question #4Next in category → · CFL language
Position:
Show:

Related questions

0 0 votes
1 1 answer
894
894 views
Harikesh Kumar asked Jan 29, 2018
894 views
Gate_2018_mock
L=wxw^r.W=(0,1)^*Is regular language how?
0 0 votes
1 1 answer
1.4k
1.4k views
Sanjay Sharma asked Dec 10, 2017
1,391 views
IF L1 and L2 are languages are recognised by machines m1 and m2 with n and m states
2 2 votes
1 1 answer
1.7k
1.7k views
raviyogi asked Nov 4, 2017
1,710 views
Ace Test Series: Theory Of Computation - Closure Property
please explain:
1 1 vote
1 1 answer
2.2k
2.2k views
learner_geek asked Aug 15, 2017
2,160 views
DECIDABILITY
Is complement of language same type or not decidable by CFL and recursive language or not???Grammar is ambiguous or not?Grammar in regular/CFL/rel decidable or not?