Theoretical Computer Science MCQ : Finite Automata - DFA, NFA, NFA to DFA, FA with output : Link2

Theoretical Computer Science MCQ & Answers

Are you worried about the answers to Theoretical Computer Science questions :Finite Automata - DFA, NFA, NFA to DFA, FA with output? 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. Two finite state machines are said to be equivalent if they------

A. have same number of states
B. have same number of edges
C. have same number of states and edges
D. recognize same set of tokens

Q.2. Which of the following option is correct?
statement 1 : Initial state of NFA is initial state of DFA.
statement 2 : The final state of DFA will be every combination of final state of NFA.

A. statement 1 is true and statement 2 is true
B. statement 1 is true and statement 2 is false
C. statement 1 is false and statement 2 is true
D. statement 1 is false and statement 2 is false

Q.3. The number of tuples in an extended Non-Deterministic Finite automata------

A. 6 B. 3
C. 7 D. 5

Q.4. The finite automata is called NFA when there exists--------for a specific input from current state to next state.

A. Multiple paths B. Single path
C. Only two paths D. None of the above.

Q.5. Transition function of DFA machine maps-----

A. Σ x Σ -> Q B. Q x Q -> Σ
C. Q x Σ -> Q D. None of the above

Q.6. Finite automata needs minimum------number of stacks.

A. 0 B. 1
C. 2 D. 3

Q.7. Transition function of NFA machine maps-----

A. Σ x Σ -> Q B. Q x Σ -> 2^{Q

C. Q x Q -> Σ
D. Q x Σ -> Q}

Q.8. Which of the following are the examples of finite state machine system?

A. Control Mechanism of an elevator, Traffic Lights
B. Combinational Locks
C. Digital Watches
D. Both A and B

Q.9. Two finite state are equivalent if -------

A. Both are final states
B. Both are Non-final states
C. both have same number of states as well as trnsitions
D. Both A and B

Q.10. State true or false:
Statement: Both NFA and ε-NFA recognize exactly the same languages.

A. true B. false
C. may be D. can't say

Q.11. The automaton which allows transformation to a new state without consuming any input symbols----

A. DFA B. NFA
C. ε-NFA D. All of the above.

Q.12. Transition function of ε-NFA is-------

A. Q x Σ -> 2^{Q

B. Q x Σ -> Σ

C. Q x Σ U {ε} ->Q
D. Q x Σ U {ε} -> 2^Q}

Q.13. ε-closure of state is combination of self state and -------

A. initial state B. final state
C. ε-reachable state D. All of the above.

Q.14. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?

A. yes B. no
C. may be D. can't say

Q.15. An ε-NFA is-------in representation.

A. Quadruple B. Quintuple
C. Triple D. None of the above.