1. 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

Explanation: Finite automaton with output is categorized din two parts: Moore M/C and Mealy M/C.

2. In Moore machine, output is produced over the change of:

a) transitions

b) states

c) all of the mentioned

d) none of the mentioned

Explanation: Moore machine produces an output over the change of transition states while mealy machine does it so for transitions itself.

3. 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

Explanation: Initial state, from which the operations begin is also initialized with a value.

4. Statement 1: Null string is accepted in Moore Machine.

Statement 2: There are more than 5-Tuples in the definition of Moore Machine.

Choose the correct option:

a) Statement 1 is true and Statement 2 is true

b) Statement 1 is true while Statement 2 is false

c) Statement 1 is false while Statement 2 is true

d) Statement 1 and Statement 2, both are false

Explanation: Even ε, when passed as an input to Moore machine produces an output.

5. The total number of states and transitions required to form a moore machine that will produce residue mod 3.

a) 3 and 6

b) 3 and 5

c) 2 and 4

d) 2 and 5

Explanation:

6. What is the output for the given language?

Language: A set of strings over ∑= {a, b} is taken as input and it prints 1 as an output “for every occurrence of a, b as its substring. (INPUT: abaaab)

a) 0010001

b) 0101010

c) 0111010

d) 0010000

Explanation: The outputs are as per the input, produced.

7. The output alphabet can be represented as:

a) δ

b) ∆

c) ∑

d) None of the mentioned

Explanation: Source-The tuple definition of Moore and mealy machine comprises one new member i.e. output alphabet as these are finite machines with output.

8. The O/P of Moore machine can be represented in the following format:

a) Op(t)=δ(Op(t))

b) Op(t)=δ(Op(t)i(t))

c) Op(t): ∑

d) None of the mentioned

Explanation: Op(t)=δ(Op(t)) is the defined definition of how the output is received on giving a specific input to Moore machine.

9. Which of the following is a correct statement?

a) Moore machine has no accepting states

b) Mealy machine has accepting states

c) We can convert Mealy to Moore but not vice versa

d) All of the mentioned

Explanation: Statement a and b is correct while c is false. Finite machines with output have no accepting states and can be converted within each other.

10. In mealy machine, the O/P depends upon?

a) State

b) Previous State

c) State and Input

d) Only Input

Explanation: Definition of Mealy Machine.