0 votes 0 votes Theory of Computation theory-of-computation finite-automata + – Vicky rix asked Apr 1, 2017 retagged Jun 4, 2017 by Arjun Vicky rix 299 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply rude commented Apr 1, 2017 reply Follow Share It's a very simple problem, It's a DFA of 10 states. that's it. 0 votes 0 votes Skan commented Apr 1, 2017 reply Follow Share @ rude, What about the case? W1>3. I am assumingW1 has {a,b}. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes This will be the DFA Deepthi_ts answered Apr 11, 2017 Deepthi_ts comment Share Follow See all 0 reply Please log in or register to add a comment.