238 views
0 votes
0 votes
xx^r /x=[0,1]* , |x|=l

Here we have restriction that on length of x should be exactly l

If only the language is given How can we say that l is finite or infinite

In one of the videos they have taken subsets of l also 2^l , how can this language be Regular and CFL

plzz explain each point properly

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
saptarshiDey asked Jan 22, 2019
538 views
L = {a^(p+q) b^(p+q) a^p , p,q>=0}Which one of the following is true about L?L is a regularL is CFL but not regularL is not a CFL
2 votes
2 votes
2 answers
3
focus _GATE asked Jan 10, 2017
520 views
L={ ai bj ck | i,j,k>=0, i<j<k}CFL OR NOT CFL ??
0 votes
0 votes
2 answers
4
Anmol Verma asked Dec 2, 2016
713 views
Is L={$a^{n}b^{n}c^{m}$ : n>m} context free...???