1 votes 1 votes explain why L1 and L3 are not cfl Kaluti asked Jan 22, 2018 Kaluti 254 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply gauravkc commented Jan 22, 2018 i edited by gauravkc Jan 23, 2018 reply Follow Share L1 : After comparing n occurrences of a and b. Then c will be checked. But again after that, machine wants to check for n occurrences of a's as we lost count while previous comparison. Which machine cannot. L3 : Even if x is pushed into stack. We don't know for which occurrences of a or b in w we should start popping to compare. 0 votes 0 votes Kaluti commented Jan 22, 2018 reply Follow Share what about L3 0 votes 0 votes gauravkc commented Jan 23, 2018 reply Follow Share Bymistake wrote L3 as L2 0 votes 0 votes Surajit commented Jan 23, 2018 reply Follow Share How the pda will look for L2?.Need to compare a with b then a with c...how to do this once a and b's are all checked how to match with c's? 0 votes 0 votes Please log in or register to add a comment.
