finite transducer

computer

Also known as: sequential machine

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

June 26, 2026

Quick Summary

A finite transducer is a type of automaton with both input and output capabilities. It can be understood as a one-way Turing machine that produces output. These are considered the weakest in terms of computational power compared to other automata, such as a universal machine.

Algebraically, a finite transducer can be defined as a quintuple (S, Q, O, M, N). Here, S represents the finite set of inputs, Q is the set of states, and O is the set of outputs. M and N are functions that determine the next state and the output, respectively, based on the current state and input. Finite transducers are fundamental in automata theory for processing sequences of symbols and generating corresponding outputs.12

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

2 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

automata theory
Finite transducers
The most important transducers are the finite transducers, or sequential machines, which may be characterized as one-way Turing machines with output. They are the weakest with respect to computing power, while the universal machine is the most powerful. There are also transducers of…
Read More
The most important transducers are the finite transducers, or sequential machines, which may be characterized as one-way Turing machines with output. They are the weakest with respect to computing power, while the universal machine is the most powerful. There are also transducers of…
Read More