# Theory of Computation MCQ (Multiple Choice Questions) - SchoolingAxis

1. When are 2 finite states equivalent?

a. Same number of transitions

b. Same number of states

c. Same number of states as well as transitions

d. Both are final states

Ans- c. Same number of states as well as transitions

2. A Language for which no DFA exist is a____

a. Regular Language

b. Non-Regular Language

c. May be Regular

d. Cannot be said

Ans- b. Non-Regular Language

3. Which of the following not an example Bounded Information?

a. fan switch outputs {on, off}

c. colour of the traffic light at the moment

d. None of the mentioned

4. An e-NFA is _____ in representation.

b. Quintuple

c. Triple

d. None of the mentioned

Ans- b. Quintuple

5. Which of the following does not belong to input alphabet if S={a, b}* for any language?

a. a

b. b

c. e

d. None of the mentioned

Ans- c. e

6. In Mealy machine:

a. Output is on edges

b. Output is inside states

c. Both of the above

d. None of the above

Ans- a. Output is on edges

7. The output of the Mealy machine will be :

a. More than input by one

b. Less than input by one

c. Same as Input

d. None of the mentioned

Ans- c. Same as Input

8. Which is true for Dead State?

a. It cannot be reached anytime

b. There is no necessity of the state

c. If control enters no way to come out from the state

d. If control enters FA deads

Ans- c. Same as Input

9. Which is true for in accessible state?

a. It cannot be reached anytime

b. There is no necessity of the state

c. If control enters no way to come out from the state

d. If control enters FA deads

Ans- a. It cannot be reached anytime

10. Which is true for Mealy Machine?

a. Output depends on present state

b. Output depends on present input

c. Output depends on present state and present input

d. Output depends on present state and past input

Ans- c. Output depends on present state and present input