664 views
1 votes
1 votes

1 Answer

0 votes
0 votes
This language is not even a CFL. Apply pumping lemma on $0^{n}1^{2n}0^{n}$

Related questions

1 votes
1 votes
1 answer
1
4 votes
4 votes
2 answers
2
srestha asked Jun 22, 2018
1,532 views
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$$\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$$\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$Which one DCFL...
0 votes
0 votes
1 answer
3
shivangi5 asked Dec 2, 2017
852 views
Consider the following languages:L1={abna2n|n>=0}L2={aabna3n|n>=0}Why L1UL2 is DCFL please explain?
6 votes
6 votes
1 answer
4
Anu007 asked Nov 4, 2017
1,130 views
Consider the follwoing LanguageL1= {0n1*0n | n>0} is DCFL or Not?L2= {0n1+0n | n>0} is DCFL or Not?