One-way Resynchronizability of Word Transducers-Reference-Cited by-同舟云学术

One-way Resynchronizability of Word Transducers

Published:2021 Issue: Volume: Page:124-143
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bose Sougata,Krishna S. N.,Muscholl Anca,Puppis Gabriele

Abstract

AbstractThe origin semantics for transducers was proposed in 2014, and it led to various characterizations and decidability results that are in contrast with the classical semantics. In this paper we add a further decidability result for characterizing transducers that are close to one-way transducers in the origin semantics. We show that it is decidable whether a non-deterministic two-way word transducer can be resynchronized by a bounded, regular resynchronizer into an origin-equivalent one-way transducer. The result is in contrast with the usual semantics, where it is undecidable to know if a non-deterministic two-way transducer is equivalent to some one-way transducer.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-71995-1_7

Reference23 articles.

1. Rajeev Alur and Pavel Cerný. Expressiveness of streaming string transducer. In IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS’10), volume 8 of LIPIcs, pages 1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.

2. Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. One-way definability of sweeping transducers. In IARCS Annual Conference on Foundation of Software Technologyand Theoretical Computer Science (FSTTCS’15), volume 45 of LIPIcs, pages 178–191. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.

3. Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. One-way definability of two-way word transducers. Logical Methods in Computer Science, 14(4):1–54, 2018.

4. Mikolaj Bojańczyk. Transducers with origin information. In International Colloquium on Automata, Languages and Programming (ICALP’14), number 8572 in LNCS, pages 26–37. Springer, 2014.

5. Mikolaj Bojańczyk, Laure Daviaud, Bruno Guillon, and Vincent Penelle. Which classes of origin graphs are generated by transducers? In International Colloquium on Automata, Languages and Programming (ICALP’17), volume 80 of LIPIcs, pages 114:1–114:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.