The Gateway to Computer Science Excellence
0 votes
117 views

 

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 ________.

in Theory of Computation by (197 points)
edited by | 117 views

1 Answer

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>
by Boss (18.4k points)
0
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
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
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,365 answers
198,495 comments
105,262 users