Register

CFL Language

257 views
1 votes
1 votes

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
saptarshiDey asked Jan 22, 2019
538 views
A language is cfl or not
L = {a^(p+q) b^(p+q) a^p , p,q>=0} Which one of the following is true about L? L is a regular L is CFL but not regular L is not a CFL
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
User Avatar
0 votes
0 votes
0 answers
3
Ajit J asked Dec 4, 2018
485 views
CFL Language
$a^{m}b^{n}c^{p}d^{q} | m+p=n+q, where m,n,p,q >=0.$ How is this cfl?
$a^{m}b^{n}c^{p}d^{q} | m+p=n+q, where m,n,p,q >=0.$How is this cfl?
User Avatar
0 votes
0 votes
0 answers
4
sanju77767 asked May 17, 2018
238 views
TOC Language is CFL or not
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
xx^r /x=[0,1]* , |x|=lHere 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...
User Avatar
Link Copied!