Equivalence of finite-valued streaming string transducers is decidable

Autor:	Muscholl, Anca, Puppis, Gabriele
Rok vydání:	2019
Předmět:	Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1902.06973 Zobrazit plný text záznamu View this record from Arxiv