The equivalence problem for deterministic MSO tree transducers is decidable (Q845868)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem for deterministic MSO tree transducers is decidable |
scientific article |
Statements
The equivalence problem for deterministic MSO tree transducers is decidable (English)
0 references
29 January 2010
0 references
formal languages
0 references
automata theory
0 references
equivalence problem
0 references
transducer
0 references
0 references
0 references
0 references
