Access Restriction

Author Bojańczyk, Mikołaj
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A (word) transducer is an automaton with output, which defines a binary relation on words, including the important special case of a function from words to words. For the uninitiated, the transducer landscape can be a bit confusing, since there are several non-equivalent models (unlike for languages, where all reasonable models of finite automata are equivalent). In this column, Emmanuel Filiot and Pierre-Alain Reynier explain this landscape, with an emphasis on the connections with logic and algebra.
Description Affiliation: University of Warsaw (Bojańczyk, Mikołaj)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2016-02-17
Publisher Place New York
Journal ACM SIGLOG News (SIGL)
Volume Number 3
Issue Number 3
Page Count 1
Starting Page 3
Ending Page 3

Open content in new tab

   Open content in new tab
Source: ACM Digital Library