# Question: give a deterministic finite automata a above the input alphabet...

###### Question details

Give a deterministic finite automata A above the input alphabet Σ = {a, b} an, which the language

L(A) = {w ∈ Σ∗∣ w = a^(n) bba or w = b^(n) aab, n ∈ N}

accepted.

Then extend this machine by the output alphabet T = {0, 1} to a
Mealy automat, which outputs 1 as soon as it recognizes a word
located in L(A). In all other cases the automat should output
0.