The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable Export

@misc{citeulike:316838, abstract = {It 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.}, archivePrefix = {arXiv}, author = {Engelfriet, Joost and Maneth, Sebastian}, citeulike-article-id = {316838}, citeulike-linkout-0 = {http://arxiv.org/abs/cs.LO/0506014}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs.LO/0506014}, day = {6}, eprint = {cs.LO/0506014}, keywords = {attribute-grammars, decidability, mso-logic, tree-transducers, xml}, month = {Jun}, posted-at = {2005-09-13 14:18:41}, priority = {2}, title = {The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable}, url = {http://arxiv.org/abs/cs.LO/0506014}, year = {2005} }

TY - ELEC ID - citeulike:316838 L3 - citeulike-article-id:316838 N2 - It 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. TI - The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable KW - attribute-grammars KW - decidability KW - mso-logic KW - tree-transducers KW - xml AU - Engelfriet, Joost AU - Maneth, Sebastian PY - 2005/Jun/06/ UR - http://arxiv.org/abs/cs.LO/0506014 ER -