Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable (Q4561509)
From MaRDI portal
scientific article; zbMATH DE number 6989819
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable |
scientific article; zbMATH DE number 6989819 |
Statements
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable (English)
0 references
6 December 2018
0 references
tree-to-string transducer
0 references
decidability
0 references
equivalence problem
0 references
macro tree transducer
0 references
polynomial ideals
0 references
