235 views
0 votes
0 votes

Let L1 = {an bm cn⎪m, n ≥ 0} and L2 = {an cn⎪n ≥ 0}. Both L1 and L2 are context free languages. If L = (L1 – L2) then L is ________

  • Finite language
  • Regular language
  • DCFL
  • Not DCFL

can anyone give the elaboration..??

1 Answer

0 votes
0 votes

L=(L1 – L2)={anbmc| n>=0,m>=1}
it is DCFL.

Related questions

0 votes
0 votes
2 answers
1
0 votes
0 votes
0 answers
2
TusharKumar asked Jan 21, 2023
311 views
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
1 votes
1 votes
1 answer
3
Gate Fever asked Jan 21, 2019
504 views
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5}which of the following is correct?L is recursiveCSLCFLregular
0 votes
0 votes
1 answer
4
Devwritt asked Feb 3, 2017
299 views
It can accepts aa and/or bb .Please check?