| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429248 | Information Processing Letters | 2006 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
