NIELIT 2016 MAR Scientist C - Section C: 32

Question

Two finite state machines are said to be equivalent if they

• A. have same number of states
• B. have same number of edges
• C. have same number of states and edges
• D. recognize same set of tokens

Comments

if they recognize same set of tokens.

Answer 1

so option A,B,C are false

and the definition of equivalent finite machines is that they accept same language.

so option D is correct.

Comments

Option D would be correct.

So if we check (option A). its saying that if two finite state machines have same number of states then both the finite state machines are equivalent.

But its wrong.

so for this lets take two finite state machines

L1 = {a*}  → L1 have one state

L2 = {b*}  → L2 also have one state

but L1 is not equal to L2   .      So option A is wrong.

 

Similarly with the same number of edges we cant guarantee that both the finite machines would be same.  Thus Option B and C are also wrong