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 Hira Thakur asked Dec 13, 2016 Hira Thakur 885 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 iamabhi222I answered Jul 31, 2021 iamabhi222I comment Share Follow See all 0 reply Please log in or register to add a comment.