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.

Statement 1: Null string is accepted in Moore Machine.
True: A Moore machine can accept the null string (ε). The output of a Moore Machine is associated with its states, and upon entering the initial state, it produces an output even before any input is processed. Therefore, the null string is effectively "accepted", as it corresponds to the initial state's output.

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

True: A Moore machine is typically defined by 6-Tuples:

M = (Q, Σ, Δ, δ, λ, q₀)

Q = Finite set of states
Σ = Input alphabet
Δ = Output alphabet
δ = Transition function (Q × Σ → Q)
λ = Output function (Q → Δ)
q₀ = Initial state
Since Moore machines use a 6-tuple definition, there are more than 5 tuples.

Thus, both statements 1 and 2 are true.

The Moore machine calculates the residue mod 3 using the following structure:

• 3 States: Each state represents a possible remainder when divided by 3, which are 0, 1, and 2.
• 6 Transitions: Each state has two transitions (for inputs 0 and 1), leading to the next state based on the current state and input.

This configuration ensures that the Moore machine can effectively compute the desired mod 3 output.

Thus option a) is correct.

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.