0 votes 0 votes While the language accepted by a given dfa is unique, there are normally many dfa's that accept a language. Find a dfa with exactly six states that accepts the same language as the dfa in figure: Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 22, 2019 Naveen Kumar 3 554 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes ...... Gurdeep Saini answered Mar 23, 2019 • edited Mar 23, 2019 by Gurdeep Saini Gurdeep Saini comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes yes we can draw with 6 state abhishekmehta4u answered Mar 25, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
