0 votes 0 votes Show that the language $L=$ {$vwv: v, w ∈$ {$a,b$}*$, |v|= 2$} is regular. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 20, 2019 Naveen Kumar 3 504 views answer comment Share Follow See 1 comment See all 1 1 comment reply KUSHAGRA गुप्ता commented Oct 2, 2019 reply Follow Share Given NFA for the language. Convert into DFA and you will get 15 states. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes we can draw a dfa for this . , so it is regular. abhishekmehta4u answered Mar 20, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Regular expression will be $((a+b)(a+b)(a+b)^*(a+b)(a+b))$ Corresponding dfa-- Verma Ashish answered Mar 20, 2019 Verma Ashish comment Share Follow See all 0 reply Please log in or register to add a comment.
