Let ∑={0,1} design NFA
Q.1. (a)
(i) {w:w = x01 where x has exactly one 1 and any number of zeros}
(ii){w : every odd position is a one}
(iii){w : w contains either the substring 000 or 010}
(b)Design a TM for accepting the language {anbncn : n>=1}
Q.If L is a regular language,need perm(L) be regular.Justify
Solution-
