Question

5. Which statement regarding a finite state machine (FSM) is NOT true: (a) In a non-deterministic FSM, a string is invalid if there is one path not leading to a final state (b) In a simple deterministic FSM, a string is invalid if there is no rule and you are not in a final state (c) In a simple deterministic FSM, not all possible transformations are specified (d) In a simple deterministic FSM, if you are in a final state and there is no rule, the string is valid (e) In a non-deterministic FSM, a string is valid if there is any path which leads to a final state

Answer 1

The statement (a) In a non-deterministic FSM, a string is invalid if there is one path not leading to a final state is NOT true

Step-by-step explanation:

A non-deterministic FSM, contrary to deterministic FSM which has only one possible thread of execution, has multiple threads and for the machine to be invalid, all threads should lead to a none accepting (final) state.