Test: Moore Machine - Computer Science Engineering (CSE) MCQ

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

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

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

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

We assume the input string to be 1101.

1. (A, 1) –> (B, 01)
Here, previous input bit + present input bit = 0 + 1 = 01 = output

2. (B, 1) –> (C, 10)
Here, previous input bit + present input bit = 1 + 1 = 10 = output

3. (C, 0) –> (A, 01)
Here, previous input bit + present input bit = 1 + 0 = 01 = output

4. (A, 1) –> (B, 01)
Here, previous input bit + present input bit = 0 + 1 = 01 = output

Thus, option (A) is correct.

The outputs are as per the input, produced.

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

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

Answer: C
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.