1 votes 1 votes Is the following language regular? Theory of Computation theory-of-computation + – Mudita asked Aug 31, 2018 Mudita 323 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply s9k96 commented Aug 31, 2018 reply Follow Share No, this isnt Regular as we have to store w to check for w again and again. even ww is not regular. 1 votes 1 votes goxul commented Aug 31, 2018 reply Follow Share Let alone regular, this is not even a DCFL as you don't know where the repetition of the string starts. 1 votes 1 votes Shaik Masthan commented Aug 31, 2018 reply Follow Share @goxul did you mean it can be CFL? 0 votes 0 votes Verma Ashish commented Aug 31, 2018 reply Follow Share is it CFL?? I think no dpda or npda possible. 0 votes 0 votes goxul commented Aug 31, 2018 reply Follow Share No, I meant that it cannot be a DCFL, as it cannot be done by a DPDA. I think it cannot be done using a PDA either, although I am not sure. 0 votes 0 votes Please log in or register to add a comment.