The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729)
From MaRDI portal
scientific article; zbMATH DE number 7572962
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem for letter-to-letter bottom-up tree transducers is solvable |
scientific article; zbMATH DE number 7572962 |
Statements
The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (English)
0 references
18 August 2022
0 references
