0 votes 0 votes Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________. Theory of Computation made-easy-test-series theory-of-computation myhill-nerode finite-automata + – jhaanuj2108 asked Sep 26, 2018 • edited Mar 4, 2019 by Aditi Singh jhaanuj2108 697 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes As per my knowledge, they are indirectly asking the number of states in minimized DFA because of the number of distinct set in myhill nerode theorem corresponds to a number of states minimized DFA. So answer should be 4 <q0,q4><q1,q2><q3><q5> Tesla! answered Sep 27, 2018 Tesla! comment Share Follow See all 2 Comments See all 2 2 Comments reply pradeepchaudhary commented Sep 29, 2018 reply Follow Share I am also interpreting the question in the same way...they are asking for the number of distinct states present in the final partition. 0 votes 0 votes Tesla! commented Sep 29, 2018 reply Follow Share Myhill nerode theorem is a standard algorithm for minimizing of DFA so the number of the distinct sets will always equal to the number of State in minimized dfa 0 votes 0 votes Please log in or register to add a comment.
