Finite-state transducer

Finite-state transducer

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output tape. This contrasts with an ordinary finite-state automaton, which has a single tape.

Excerpt from the Wikipedia article “Finite-state transducer”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Finite-state transducer to your collection.

Play for free

Related cards