License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.122
URN: urn:nbn:de:0030-drops-106988
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10698/
Go to the corresponding LIPIcs Volume Portal

Muscholl, Anca ; Puppis, Gabriele

Equivalence of Finite-Valued Streaming String Transducers Is Decidable

pdf-format:
LIPIcs-ICALP-2019-122.pdf (0.6 MB)

Abstract

In this paper we provide a positive answer to a question left open by Alur and and Deshmukh in 2011 by showing that equivalence of finite-valued copyless streaming string transducers is decidable.

BibTeX - Entry

@InProceedings{muscholl_et_al:LIPIcs:2019:10698,
  author =	{Anca Muscholl and Gabriele Puppis},
  title =	{{Equivalence of Finite-Valued Streaming String Transducers Is Decidable}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{122:1--122:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10698},
  URN =		{urn:nbn:de:0030-drops-106988},
  doi =		{10.4230/LIPIcs.ICALP.2019.122},
  annote =	{Keywords: String transducers, equivalence, Ehrenfeucht conjecture}
}

Keywords: String transducers, equivalence, Ehrenfeucht conjecture
Collection: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date: 2019
Date of publication: 04.07.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI