0 votes 0 votes $ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $ Draw the DFA and also write the Reg exp for the above language. Theory of Computation regular-expression finite-automata theory-of-computation + – Tuhin Dutta asked Dec 4, 2017 Tuhin Dutta 577 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments joshi_nitish commented Dec 4, 2017 reply Follow Share ohh, yes. its 7.....silly mistake :( 0 votes 0 votes Ashwin Kulkarni commented Dec 4, 2017 reply Follow Share @Pawan Kumar we can't write that way because that expression is accepting "ab" also which is not in the language. 1 votes 1 votes Pawan Kumar 2 commented Dec 4, 2017 reply Follow Share oh yes....thanks :) 1 votes 1 votes Please log in or register to add a comment.