📚 Question Bank Q83 — Theory of Computation
Tags
Theory of Computation
Q83. Marks: +2.0 UGC NET Paper 2: Computer Science 7th Dec 2023 Shift 2

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.

Choose the correct answer from the options given below:

1.(A) and (B) Only
2.(A), (B) and (C) Only ✓ Correct
3.(B) and (D) Only
4.(A), (B) and (D) Only
📄 All “Theory of Computation” questions across papers
🏷 Change Tag for this Question