The equivalence problem for deterministic MSO tree transducers is decidable

Joost Engelfriet, Sebastian Maneth

Research output: Contribution to journalArticlepeer-review

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.
Original languageEnglish
Pages (from-to)206-212
Number of pages7
JournalInformation Processing Letters
Volume100
Issue number5
DOIs
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'The equivalence problem for deterministic MSO tree transducers is decidable'. Together they form a unique fingerprint.

Cite this