ans is 2
use equivalence method to solve this
take (3,4) (1,2,5,6) as g1 and g2
here (3,4) are final states and (1,2,5,6) are non final states
| states |
a |
b |
| 1 |
g2 |
g1 |
| 2 |
g2 |
g2 |
| 5 |
g2 |
g2 |
| 6 |
g2 |
g1 |
as (1,6) are having same values take them as one group.
as(2,5) have same value take them as one group
finally we have (3,4),(1,6) and (2,5)
now draw the the transition diagram with the state name 34,16,25. follow the transition table which is given in the question.
we find 16 and 34 states are connected and 25 is unreachable.
so we have only 2 equivalence classes
