1. In mealy machine, the O/P depends upon?
a. State
b. Previous State
c. State and Input
d. Only Input
Ans- c. State and Input
2. For a give Moore Machine, Given Input='101010', thus the output would be of length:
a. |Input|+1
b. |Input|
c. |Input-1|
d. Cannot be predicted
Ans- a. |Input|+1
3. In Moore machine, output is produced over the change of:
a. transitions
b. states
c. Both
d. None of the mentioned
Ans- b. states
4. 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 mentioned
Ans- b. Finite automata with output
5. The number of elements in the set for the Language L={x?(?r) *|length if x is at most 2} and ?={0,1} is_____
a. 7
b. 6
c. 8
d. 5
Ans- a. 7
6. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______
a. Compiler
b. Interpreter
c. Loader and Linkers
d. None of the mentioned
Ans- a. Compiler
7. Which of the following is a not a part of 5-tuple finite automata?
a. Input alphabet
b. Transition function
c. Initial State
d. Output Alphabet
Ans- d. Output Alphabet
8. The minimum number of states required to recognize an octal number divisible by 3 are/is
a. 1
b. 3
c. 5
d. 7
Ans- b. 3
9. A regular language over an alphabet ? is one that cannot be obtained from the basic languages using the operation
a. Union
b. Concatenation
c. Kleene*
d. All of the mentioned
Ans- d. All of the mentioned
10. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____
a. reflexive
b. transitive
c. symmetric
d. reflexive and transitive
Ans- d. reflexive and transitive