488 views
3 votes
3 votes

$L_1 =\{a^n b^m c^n \mid m,n \geq 0\}$ and $L_2=\{ a^n b^n\mid n\geq 0\}$. If $L=L_2-L_1$ then $L$ is

  1. finite language
  2. regular language
  3. DCFL  
  4. not DCFL

1 Answer

Best answer
6 votes
6 votes

Option C.

strings in L1 ={epsilon, ac, abc, aabcc, ...........}

string in L2 = {epsilon , ab, aabb, aaabbb.........}

in both language only epsilon is common

L2-L1 = { ab, aabb, aaabbb........}

={a^n b^n | n>0} which is DCFL

selected by

Related questions

2 votes
2 votes
2 answers
2
3 votes
3 votes
1 answer
4
saurabh rai asked Oct 21, 2016
1,106 views
Is the language $L=\left \{ (0^{n}1^{n})^{*} |n\geq 0 \right \}$ is DCFL ?