Theoretical Computer Science MCQ : Finite Automata - FA with output, Minimization of DFA, Moore to Mealy machine, Mealy to Moore Machine : Link3
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Finite Automata - FA with output, Minimization of DFA, Moore to Mealy machine, Mealy to Moore Machine? We have arranged the Show Answer button under the each question. Candidates can click on it to know the right option among the given alternatives. Furthermore, the applicants can check our web portal @ www.totalmcq.com to take part in more MCQ on various subject. Wish, the given information about the Theoretical Computer Science MCQ will helpful to the advance and can learn the various types of questions and answers.
Q.1. Moore Machine is an application of------
A. Finite automata without input
B. Finite automata with output
C. Non- Finite automata with output D. None of the above
Q.2. In Moore machine the output depends on--------
A. present state
B. present transition
C. input D. None of the above
Q.3. In Mealy machine the output depends on--------
A. present state
B. present state and current input symbol
C. current input symbol D. transition
Q.4. Statement 1: Null string is accepted in Moore Machine.
Statement 2: There are 6-Tuples in the definition of Moore Machine.
Choose the correct option:
A. Statement 1 is true and Statement 2 is true
B. Statement 1 is false and Statement 2 is true
C. Statement 1 is true and Statement 2 is false
D. Statement 1 is false and Statement 2 is false
Q.5. The total number of states and transitions required to form a moore machine that will produce residue mod 3.
A. 3 and 5
B. 2 and 4
C. 3 and 6
D. 2 and 5
Q.6. In Moore machine, the output alphabet can be represented as-----
A. δ
B. ∆
C. ∑
D. λ
Q.7. In Moore machine, the output function can be represented as-----
A. Q → ∆
B. Q×∑ → Q
C. Q×∑→ ∆
D. None of the above.
Q.8. In Mealy machine, the output function can be represented as-----
A. Q → ∆
B. Q×∑ → Q
C. Q×∑→ ∆
D. None of the above.
Q.9. Which of the following statement is incorrect?
A. A Mealy machine has no terminating state
B. A Moore machine has no terminating state
C. Converting from Mealy into Moore machine and vice versa is possible
D. Moore machine accepting states
Q.10. Moore machine consist of tuples as--------
A. M=(Q, q0, ∑, ∆, δ, λ)
B. M=(Q, ∑, δ, q0, F)
C. M=(Q, q0, ∑, δ, λ)
D. M=(Q, q0, ∑, ∆, δ)
Q.11. In Moore machine is of length n then the output string length will be-----
A. n
B. n+1
C. n + 2 D. n + n
Q.12. Mealy and Moore machines are also called-----
A. Turing machines
B. Linear bounded automata
C. Transducer
D. None of the above.
Q.13. Conversion of moore to mealy machine, where λ'(q,a) = -------
A. δ(q,a)
B. b
C. λ(δ(q,a))
D. λ(q,a)
Q.14. Conversion of mealy to moore machine, where δ'([q,b],a) = -------
A. [δ(q,a),λ(q,a)]
B. λ(δ(q,a))
C. δ(q,a)
D. λ(q,a)
Q.15. Major difference between mealy and moore machine is --------
A. The output of the former depends on the present state and the current input
B. The output of the former depends on the current input
C. The output of the former depends only on the present state
D. None of the above.