1 votes 1 votes Let L1 be a language from DCFL, L2 be from LR(k) grammar, and L3 be a language accepted by 2DFA. Choose the correct statement, 1) There is no algorithm to decide if L1⋂L2 is empty. 2) L1 = L2. 3) L2 = L3. 4) A problem of L1 = L3 is undecidable. Theory of Computation theory-of-computation context-free-language dcfl + – AnilGoudar asked Sep 18, 2017 • retagged Oct 13, 2017 by Arjun AnilGoudar 440 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L2 is lr(k) than it has one to one correspondance with Dcfl. So both are dcfl, but intersection is undecidable for Dcfl Hence first is true 2. False 3. Undecidable 4.true sonveer tomar 1 answered Nov 8, 2017 sonveer tomar 1 comment Share Follow See all 0 reply Please log in or register to add a comment.