Question

_____ can be in exactly one of a countable number of states at any given time.

(a) Push-down automata

(b) Agent state machine

(c) Finite state machine

(d) Infinite state machine

Answer 1

Correct answer is (c) Finite state machine

For explanation: A state machine is any device that stores a status for a given time. It consists of a finite set of distinct states, a set of inputs, a set of outputs, a next state map and an output map. Finite state machine can be in exactly one of a finite number of states at any given time.