COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
states
|
|
|
edges
|
|
|
states and edges
|
|
|
none of these
|
Detailed explanation-1: -Explanation: Two finite state machines are said to be equivalent if they recognize the same set of tokens.
Detailed explanation-2: -When are 2 finite states equivalent? Explanation: Two states are said to be equivalent if and only if they have same number of states as well as transitions.
Detailed explanation-3: -An Automaton is a machine that has a finite number of states. Any Two Automaton is said to be equivalent if both accept exactly the same set of input strings.
Detailed explanation-4: -Two sequential networks are said to be equivalent if very state in the first network has an equivalent state in the second network, and vice versa. EQUIVALENT STATES: Two states in a sequential network are said to be equivalent if we cannot tell them apart by observing input and output sequences.
Detailed explanation-5: -An equivalence relation on the set of automata, which arises in the context of studying some individual internal properties of automata. Such a property is usually the behaviour of automata (cf. Automaton, behaviour of an), since two automata are considered equivalent if their behaviour is identical.