Theory of Computation2080.15 marksFinite State Machines with output
Design a Mealy machine over {a, b} that generates output 'A' if the input string ends with aa else output 'B' if the string ends with bb.
Design a Mealy machine over {a, b} that generates output 'A' if the input string ends with aa else output 'B' if the string ends with bb. [5]
A Mealy Machine is a 6-tuple M = (Q, Σ, Δ, δ, λ, q₀) where: - Q = finite set of states - Σ = input alphabet - Δ = output alphabet - δ = transition function (Q × Σ → Q) - λ = output function (Q × Σ → Δ) - q₀ = initial state Note: In a Mealy machine, output depends on both the current state and cur...