Machines with Output
Explore finite-state transducers, focusing on Mealy machines that produce output while transitioning states. Understand how these machines detect input changes, recognize overlapping substrings, and implement an even parity bit for error checking. This lesson enhances your grasp of automata that generate output beyond simple acceptance.
We'll cover the following...
Mealy machines
The following finite automaton echoes all its input except for the text of dollar-delimited comments.
The generic term for such an output-producing machine is finite-state transducer, borrowing the name from electronics (a transducer converts energy from one form to another). Our transducers convert input text to output text. The machine in the figure below emits output as it moves from one state to another, using a slash on transitions to separate the input from the output. A transducer like this is also called a
Tracking changes in input
The Mealy machine in the figure below emits a whenever the input symbol changes, and a ...