0 0 votes minimized dfa for strings starts with ab and ends with aba over Σ={a,b} Theory of Computation theory-of-computation finite-automata + – Rahul_Rathod_ 1.2k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes total 7 state along with trap state BASANT KUMAR answered Jul 23, 2018 • edited Jul 23, 2018 by BASANT KUMAR BASANT KUMAR comment Share Follow See all 6 Comments 6 6 Comments reply Show 3 previous comments Shaik Masthan commented Jul 23, 2018 reply Follow flag It need 8states including DS 0 0 replyShare BASANT KUMAR commented Jul 23, 2018 reply Follow flag i already included dead state .qt is dead state 0 0 replyShare Shaik Masthan commented Jul 23, 2018 reply Follow flag Sorry for that, i mistakenly included equal state.... Yes it will require only 7states including DS 1 1 replyShare Please log in or register to add a comment.
