6 votes 6 votes Consider the follwoing Language L1= {0n1*0n | n>0} is DCFL or Not? L2= {0n1+0n | n>0} is DCFL or Not? Theory of Computation theory-of-computation dcfl + – Anu007 asked Nov 4, 2017 • edited Nov 4, 2017 by Anu007 Anu007 1.2k views answer comment Share Follow See all 21 Comments See all 21 21 Comments reply Show 18 previous comments joshi_nitish commented Nov 5, 2017 reply Follow Share @Shubhanshu it is actually (1,0/0)....i have wrote it by mistake. 0 votes 0 votes Shubhanshu commented Nov 5, 2017 reply Follow Share So, which means we are doing nothing with stack when 1 starts. 0 votes 0 votes joshi_nitish commented Nov 5, 2017 reply Follow Share yes.. 0 votes 0 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes L1 is a union of two languages L11 and L12, where L11 = $0^{2n}$ replace $1^*$ with epsilon L12 = {$0^n1^+0^n$} L1 = L11 U L12 = Regular Language UNION DCFL = DCFL L12 and L2 are same languages. Hence, First and second both languages are DCFL. Manu Thakur answered Nov 4, 2017 • selected Nov 4, 2017 by Anu007 Manu Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.