On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the equivalence problem for letter-to-letter top-down tree transducers |
scientific article; zbMATH DE number 1238806
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the equivalence problem for letter-to-letter top-down tree transducers |
scientific article; zbMATH DE number 1238806 |
Statements
On the equivalence problem for letter-to-letter top-down tree transducers (English)
0 references
12 January 1999
0 references
top-down transducers
0 references
tree automata
0 references
0.95230365
0 references
0.9120184
0 references
0.91168374
0 references
0.9052991
0 references
0.89782226
0 references
0.89149487
0 references
0.88755614
0 references
