1 votes 1 votes L1 = {anbncm} U {cambndn} L2= {anbn} U {xanb2n} Theory of Computation theory-of-computation context-free-language dcfl + – Durgesh Singh asked Aug 15, 2017 edited Aug 15, 2017 by Durgesh Singh Durgesh Singh 762 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Anjan commented Aug 15, 2017 reply Follow Share Consider i) {a^n b^n c^m} U {ca^m b^n d^n} Here we are deterministically deciding which path to choose if first we encounter 'a' then a's should match b's if first we encounter 'c' then b's should match d's. 0 votes 0 votes Durgesh Singh commented Aug 15, 2017 reply Follow Share thanks :) I could not notice this ..my bad !! 0 votes 0 votes iarnav commented Sep 19, 2017 reply Follow Share @Anjan Why are we pushing "c" (c,zo/cz0) and then goes to next state? 0 votes 0 votes Anjan commented Sep 25, 2017 reply Follow Share if we doesn't go to next state , then we may accept strings of the form a^n c^n...which are not in language 0 votes 0 votes Please log in or register to add a comment.