Definition
Moore Automaton
A Moore automaton is a special case of a transducer that is defined by a tuple:
where:
is the finite set of states is the input alphabet is the output alphabet : is the transition function : is the output function is the initial state A Moore automaton is a a deterministic automaton that doesn’t have empty word transitions, has an output function, a single initial state, and no explicit accepting states (
).
Output Function
Extended Output Function
Extended Output Function
The extended output function
is a function that takes a state and an input string and returns the output .