Transducers with origin information
Formal Languages and Automata Theory
2013-09-25 v1
Abstract
Call a string-to-string transducer regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to treat origin information as part of the semantics of a regular string-to-string transducer. With such semantics, the model admits a machine-independent characterisation, Angluin-style learning in polynomial time, as well as effective characterisations of natural subclasses such as one-way transducers or first-order definable transducers.
Cite
@article{arxiv.1309.6124,
title = {Transducers with origin information},
author = {Mikołaj Bojańczyk},
journal= {arXiv preprint arXiv:1309.6124},
year = {2013}
}