Aperiodic two-way transducers and FO-transductions
Formal Languages and Automata Theory
2021-03-30 v1
Abstract
Deterministic two-way transducers on finite words have been shown by Engelfriet and Hoogeboom to have the same expressive power as MSO-transductions. We introduce a notion of aperiodicity for these transducers and we show that aperiodic transducers correspond exactly to FO-transductions. This lifts to transducers the classical equivalence for languages between FO-definability, recognition by aperiodic monoids and acceptance by counter-free automata.
Cite
@article{arxiv.2103.15651,
title = {Aperiodic two-way transducers and FO-transductions},
author = {Olivier Carton and Luc Dartois},
journal= {arXiv preprint arXiv:2103.15651},
year = {2021}
}