Theoretical Computer Science MCQ : Finite Automata - conversion of dfa to nfa, Minimization of DFA : Link5
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Finite Automata - conversion of dfa to nfa, Minimization of DFA? 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. Can a DFA recognize a palindrome number?
A. Yes
B. No
C. Yes, with input alphabet as ∑*
D. Can’t be determined
Q.2. Two finite state machines are said to be equivalent if they-----
A. Have the same number of edges
B. Have the same number of states
C. Recognize the same set of tokens D. Have the same number of states and edges
Q.3. Myhill-Nerode Theorem is used for-----
A. Minimization of DFA
B. Conversion of NFA
C. Conversion of DFA D. Maximization of NFA
Q.4. Number of states in the minimized DFA of the following DFA will be------
A. 1
B. 2
C. 3
D. 4
Q.5. What is thr language of the following DFA?
A. {w | w contains atleast three 0's}
B. {w | w contains number of 0 as a multiple of 3 and number of 1 as a multiple of 2}
C. {w | w contains atleast three 0's and two 1's}
D. {w | w contains atleast three 0's and even number of 1's}
Q.6. Which one of the following is FALSE?
A. There is unique minimal DFA for every regular language
B. Every NFA can be converted to an equivalent PDA.
C. Complement of every context-free language is recursive.
D. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
Q.7. The finite automata accept the following language------
A. context free language
B. regular language
C. context sensitive language
D. all 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