TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
states
|
|
|
edges
|
|
|
states and edges
|
|
|
none of these
|
Detailed explanation-1: -Answer. Explanation: Two finite state machines are said to be equivalent if they: Have the same number of edges.
Detailed explanation-2: -Two finite automata are considered “equivalent” if they have the same alphabet and accept the same set of strings (i.e., the same language).
Detailed explanation-3: -Definition. A Finite State Machine is a model of computation based on a hypothetical machine made of one or more states. Only one single state of this machine can be active at the same time. It means the machine has to transition from one state to another in to perform different actions.
Detailed explanation-4: -The total no. of states required by Finite State Machine(FSM) is 2mn. Hence, the correct answer is “option3".