The many faces of a translation

https://doi.org/10.1016/j.jcss.2005.08.003Get rights and content
Under an Elsevier user license
open archive

Abstract

First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this characterization lifts to “V-translations” and “V-single-valued-NFTs”, where V is an arbitrary monoid pseudovariety that is closed under reversal. More strikingly, two-way V-transducers are introduced, and the following three models are shown exactly equivalent to Eilenberg's classical notion of a bimachine when V is a group variety or when V is the variety of aperiodic monoids: V-translations, V-single-valued-NFTs and two-way V-transducers.

Keywords

Logic in computer science
Finite model theory
Descriptive complexity
Monoids
Automata theory

Cited by (0)

1

Supported by NSERC of Canada and by FCAR du Québec.

2

Supported by NSERC of Canada and by FCAR du Québec.