1 votes 1 votes L={vuv|v,u∈{a,b}*,|v|=3 } . Is L regular ? Theory of Computation theory-of-computation regular-language + – Xylene asked Sep 6, 2017 • edited Sep 6, 2017 by Xylene Xylene 526 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Xylene commented Sep 6, 2017 reply Follow Share .... 0 votes 0 votes joshi_nitish commented Sep 6, 2017 reply Follow Share the smallest string's length present in L is 6 only. 1 votes 1 votes Xylene commented Sep 6, 2017 reply Follow Share Yaa, I misread your statement. 0 votes 0 votes Please log in or register to add a comment.