Which of the statement is/are CORRECT ?
(A) Moore and Mealy machines are finite state machines with output capabilities.
(B) Any given Moore machine has an equivalent Mealy machine.
(C) Any given Mealy machine has an equivalent Moore machine.
(D) Moore machine is not a finite state machine.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. (A), (B) and (C) Only
Explanation
Moore and Mealy machines are finite-state machines with output, and each can be converted into an equivalent machine of the other kind. A Moore machine is a finite-state machine, so D is false.
More Theory of Computation and Compilers questions
- Match List - I with List - II according to input to the compiler phase that process it :
- Arrange the following phases of a compiler as per their order of execution (start to end) (a) Target code generation (b) Syntax Analysis (c…
- Consider the following finite automata F1 that accepts a language L Let F2 be a finite automata which is obtained by reversal of F1. Then w…
- Which phase of compiler checks the grammar of programming?
- A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possible along with some other inputs) is decidab…
- Which of the following parser is most powerful parser?