UGC NET Computer Science July 2018 - II Question 31

Question 31

---

31. Two finite state machines are said to be equivalent if they :

Options:

1. (1) Have the same number of edges
2. (2) Have the same number of states
3. (3) Recognize the same set of tokens
4. (4) Have the same number of states and edges

Answer : (3) Recognize the same set of tokens

Explanation Question 31

Two automata M and M Two automata M and M′ are called equivalent, if for an arbitrary input sequence applied at both automata, the same output input sequence applied at both automata, the same output sequence results:
∀ ã . λ *(q0, ã) = λ' * (q0, ã)

Two finite state machine are said to be equivalent if, starting from their respective initial states, they will produce the same output sequence when they are given the same input sequence. That implies they must recognize the same set of tokens .

So, Option (3) is correct answer.

Reference : Finite state automata machines equivalence

Previous	Next
UGC NET CS 2018 July - II Question 30	UGC NET CS 2018 July - II Question 32