Chapter 4 --- Little Quiz                                                                
1. Which of the following statements is incorrect?

(a) The sequential machine is defined to have no final state.

(b) The sequential machine may be regarded as an extension of the deterministic finite automaton.

(c) The two types of sequential machines, Mealy and Moore, are different in their capabilities of accepting and yielding strings.

(d) The serial adder can be modeled by a Mealy machine.

2. Which of the following statements is incorrect?

(a) A binary counter may be modeled by a Moore machine.

(b)   The next state of the Moore machine depends on the current state and the input symbol.

(c)  The output of the Mealy machine depends only on the current state.

(d) An output symbol is emitted by the Moore machine in its initial state even when there is no input symbol yet.

3. Which of the following statements is incorrect?

(a) The Mealy machine changes its state according to its current state and the input symbol.

(b) A sequential machine changes its output and state sequentially according to the input and the current state.

(c) A Mealy machine yields an output symbol in its initial state.

(d) A merit of using the transition table of the digital system style is that there is no difference between the table for the Mealy machine and that for the Moore machine.

4. Which of the following statements is incorrect?

(a) Boolean expressions for the circuit output equation and the flipflop input equations of a digital circuit may be simplified by use of Karnaugh maps.

(b) A DFA may be implemented by use of a sequential machine with the output of 1 representing string acceptance and the output of 0 representing string rejection.

(c) The transition table of the digital system style of the Mealy machine and that of the Moore machine are different in appearance.

(d) When a digital system is started, the flipflops in it will get into arbitrary states.

5. Which of the following statements is incorrect?

(a) The sum of the serial adder is regarded as an output of the  Mealy machine which models the adder.

(b) The carry of the serial adder is kept in the flipflop as the next state of the Mealy machine which models the adder.

(c) A finite automaton has outputs other than "accept" and "reject."

(d) A binary counter keeps its next count value into the flipflops as the next state of the Moore machine which models the counter.