The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable

Simple item page
dc.creatorEngelfriet, Joost
dc.creatorManeth, Sebastian
dc.date2005-06-06
dc.date.accessioned2026-07-07T03:23:05Z
dc.date.available2026-07-07T03:23:05Z
dc.descriptionIt is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.
dc.identifierhttps://arxiv.org/abs/cs/0506014
dc.identifierhttp://arxiv.org/abs/cs/0506014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32806
dc.subjectLogic in Computer Science
dc.titleThe Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
dc.typetext

Files

Collections

arXiv