Theoretical Computer Science MCQ : Finite Automata - FA with output, Minimization of DFA, Moore to Mealy machine, Mealy to Moore Machine : Link4
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. Choose the correct statements.
A. Any given Mealy machine has an equivalent Moore machine.
B. Any given Moore machine has an equivalent Mealy machine.
C. Moore and Mealy machines are FSM's with output capability.
D. All of the above
Q.2. Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least----
A. N^2
B. 2N
C. 2^N D. N!
Q.3. The relation between NFA-accepted languages and DFA accepted languages is-----
A. >
B. <
C. = D. <=
Q.4. Which one is a FALSE statement?
A. There exists a unique DFA for every regular language
B. NFA can always are converted to a PDA
C. Complement of CFL is always recursive
D. Every NDFA can be converted to a DFA
Q.5. The reorganizing capability of NDFA and DFA----
A. May be different
B. Must be different
C. Must be same
D. None of the above
Q.6. Grammars that can be translated to DFAs-----
A. Left linear grammar
B. Right linear grammar
C. Generic grammar
D. All of the above.
Q.7. A language is regular if and only if it is accepted by finite automata.
A. statement is true
B. statement is false
C. Statement is partially true
D. None of the above.
Q.8. Which of the following belongs to the epsilon closure set of a?
A. {f1, f2, f3}
B. {f1, f2}
C. {a, f1, f2, f3}
D. {a, f1, f2}
Q.9. Which of the following does the given Mealy machine represents?
A. 1’s Complement
B. 2’s Complement
C. 10’s Complement
D. 9’s Complement
Q.10. The number of elements present in the ε-closure(A) in the given diagram.
A. 1
B. 2
C. 3
D. 4
Q.11. Which of the following will not be accepted by the following DFA?
A. ababaabaa
B. abbbaa
C. abbbaabb D. abbaabbaa
Q.12. Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}
A. δ (q0, a) =q0
B. δ (F, a) =D
C. δ (F, a) =q1
D. δ (q1, a) =D
Q.13. Reverse of a DFA can be formed by----
A. using PDA
B. making final state as non-final
C. making final as starting state and starting state as final state
D. None of the above.
Q.14. The language accepted by this DFA is---
A. b*ab*ab*ab*
B. (a+b)*
C. b*a(a+b)*
D. b*ab*ab*
Q.15. The minimum state automaton equivalent to the below FSA has the following number of states----
A. 1
B. 2
C. 3 D. 4