The many faces of a translation
作者:
Highlights:
•
摘要
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.
论文关键词:Logic in computer science,Finite model theory,Descriptive complexity,Monoids,Automata theory
论文评审过程:Received 18 January 2005, Revised 23 April 2005, Available online 19 October 2005.
论文官网地址:https://doi.org/10.1016/j.jcss.2005.08.003