885 views
1 votes
1 votes
for a FA of n state the maximum length of string that must be consider to distinguish two states is:

a:n

b:n-1

c:n-2

d:none

1 Answer

1 votes
1 votes
Suppose we have 4 states in the automata so the max length string that’s needed to differentiate between first and the last state is 3, so for n states it must be n-1.

 

Hence ans is B

Related questions

0 votes
0 votes
0 answers
1
Hira Thakur asked Sep 3, 2017
386 views
the number of state of the FSM required to simulate the behavior of a computer with a memory capable of storing m words each of length is n bit is:1) m*2^n2)2^m-n3)2^mn4)...