0 votes 0 votes closed as a duplicate of: MadeEasy Test Series: Theory Of Computation - Identify Class Language Let L1 ={anbmcn | m,n>=1} and L2 ={ anbn | n>=0} If L={L1 -L2 } then L is A) Finite language B) Regular C) DCFL D) CFL but not DCFL iita asked Jan 18, 2017 • closed Jan 18, 2017 by mcjoshi iita 446 views comment Share Follow See all 0 reply Please log in or register to add a comment.