2 votes 2 votes Is this regular L={w | w $\varepsilon$ (0,1)* w is of the form (0i1)n for i=1,2,3...n ,n>=0} ? Theory of Computation theory-of-computation regular-language + – junaid ahmad asked Dec 1, 2017 junaid ahmad 528 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments prateekdwv commented Dec 1, 2017 reply Follow Share Yes, it is accepting. But it should not accept because $001$ do not belong to given language. 0 votes 0 votes junaid ahmad commented Dec 1, 2017 reply Follow Share But how, see language is generating 001 when i=2 and n=1 0 votes 0 votes Red_devil commented Dec 1, 2017 reply Follow Share you are forgetting that i<=n 0 votes 0 votes Please log in or register to add a comment.