Aperiodic String Transducers

Abstract : Regular string-to-string functions enjoy a nice triple characterization through deterministic two-way transducers (2DFT), streaming string transducers (SST) and MSO definable functions. This result has recently been lifted to FO definable functions, with equivalent representations by means of aperiodic 2DFT and aperiodic 1-bounded SST, extending a well-known result on regular languages. In this paper, we give three direct transformations: i) from 1-bounded SST to 2DFT, ii) from 2DFT to copyless SST, and iii) from k-bounded to 1-bounded SST. We give the complexity of each construction and also prove that they preserve the aperiodicity of transducers. As corollaries, we obtain that FO definable string-to-string functions are equivalent to SST whose transition monoid is finite and aperiodic, and to aperiodic copyless SST.
Document type :
Journal articles
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02003676
Contributor : Pierre-Alain Reynier <>
Submitted on : Friday, February 1, 2019 - 12:55:55 PM
Last modification on : Friday, February 15, 2019 - 1:25:27 AM
Long-term archiving on : Thursday, May 2, 2019 - 8:33:42 PM

File

ijfcs18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02003676, version 1

Collections

Citation

Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier. Aperiodic String Transducers. International Journal of Foundations of Computer Science, World Scientific Publishing, 2018. ⟨hal-02003676⟩

Share

Metrics

Record views

41

Files downloads

92