1 votes 1 votes Theory of Computation theory-of-computation dcfl + – pranab ray asked Dec 9, 2017 pranab ray 664 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Ashwin Kulkarni commented Dec 9, 2017 reply Follow Share @Pranb check my explanation. You'll get the exact point. Here if you push two 0's for 1's two get 0l12l then how you can verify at least 0l are present in the string or not. hence we required 3 comparisons hence not DCFL 0 votes 0 votes pranab ray commented Dec 9, 2017 reply Follow Share THANKS I GOT IT:) 0 votes 0 votes akshat sharma commented Dec 9, 2017 reply Follow Share if in last 0 it is 0^n then we can say that it is DCFL 0l12l0n 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes This language is not even a CFL. Apply pumping lemma on $0^{n}1^{2n}0^{n}$ Joey answered Dec 12, 2022 Joey comment Share Follow See all 0 reply Please log in or register to add a comment.