0 votes 0 votes {$a^nb^{n+k}|n\geq0, k\geq1$} $\cup$ {$a^{n+k}b^n|n\geq0, k\geq3$} It is DCFL or not? Theory of Computation theory-of-computation + – Gupta731 asked Dec 31, 2018 Gupta731 276 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Magma commented Dec 31, 2018 reply Follow Share i think it's DCFL 0 votes 0 votes Gupta731 commented Dec 31, 2018 reply Follow Share But in the second part how the machine will know that k part of a has ended and n part has started 0 votes 0 votes Verma Ashish commented Dec 31, 2018 reply Follow Share @Gupta731 for second part -- after all b's are over then if a's are still there then we have to check for k>=3. So we draw 3 states extra and after that any number of a are accepted. 2 votes 2 votes Gupta731 commented Dec 31, 2018 reply Follow Share Yeah got it, thanks 0 votes 0 votes Please log in or register to add a comment.