1 votes 1 votes L = {0ku0k | k >=1 and u ∈ ∑* }. Is L is regular ? Theory of Computation regular-language theory-of-computation + – amrendra pal asked Aug 22, 2017 amrendra pal 211 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.