edited by
1,176 views
6 votes
6 votes

Consider the follwoing Language

L1= {0n1*0n | n>0} is DCFL or Not?

L2= {0n1+0n | n>0} is DCFL or Not?

edited by

1 Answer

Best answer
3 votes
3 votes

L1 is a union of two languages L11 and L12, where 
L11 = $0^{2n}$ replace $1^*$ with epsilon
L12 = {$0^n1^+0^n$}  

L1 = L11 U L12 = Regular Language UNION DCFL = DCFL

L12 and L2 are same languages.

Hence, First and second both languages are DCFL.

selected by

Related questions

4 votes
4 votes
2 answers
1
srestha asked Jun 22, 2018
1,611 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...
1 votes
1 votes
1 answer
2
pranab ray asked Dec 9, 2017
705 views
0 votes
0 votes
1 answer
3
shivangi5 asked Dec 2, 2017
874 views
Consider the following languages:L1={abna2n|n>=0}L2={aabna3n|n>=0}Why L1UL2 is DCFL please explain?
2 votes
2 votes
2 answers
4
Aditi Tiwari asked Dec 24, 2015
1,869 views
$$L_1 = \left \{a^n \,c\, b^n \right \} \cup \left \{ a^{2n} \,d\, b^n \right \}$$$$L_2 = \left \{a^{3k} \, b^{3k} \mid k \geq 0 \right \}$$