4 votes 4 votes $L={{0^{l}1^{m}0^{l+m}| l, m\geq 0}}$ Is it DCFL? Explain? Theory of Computation made-easy-test-series theory-of-computation dcfl identify-class-language + – Meghashyam Sujay asked Dec 29, 2016 edited Mar 7, 2019 by adeebafatima1 Meghashyam Sujay 963 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments vijaycs commented Jan 22, 2017 reply Follow Share ^ I think, 0100 belongs to the given language and it is also being accepted by above DPDA ... just follow the steps.. 0 --- push one 0 -- stack -- 0z 1 --- push one more 0 -- stack - 00z 0 -- pop one 0 ---stack -- 0z 0 -- pop one 0 --stack ---z epsilon -- top = z...accept am I right ?? 1 votes 1 votes sudsho commented Jan 23, 2017 reply Follow Share yea .i couldnt find any counter example in ur dpda :) 1 votes 1 votes Tendua commented Jan 23, 2017 reply Follow Share Yes the pda seems correct. Was a gud question. Thanks everyone for the discussion. 1 votes 1 votes Please log in or register to add a comment.
Best answer 7 votes 7 votes It is DCFL. Using three different stack symbols to push: stack symbols : {$0$,$1$,$Z$} Using only two stack symbol to push: (as commented above) dd answered Jan 23, 2017 selected Jan 23, 2017 by sudsho dd comment Share Follow See all 0 reply Please log in or register to add a comment.