The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455)
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: The complexity of the exponential output size problem for top-down and bottom-up tree transducers |
scientific article; zbMATH DE number 1853200
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the exponential output size problem for top-down and bottom-up tree transducers |
scientific article; zbMATH DE number 1853200 |
Statements
The complexity of the exponential output size problem for top-down and bottom-up tree transducers (English)
0 references
14 January 2003
0 references
0.9253963
0 references
0.9121329
0 references
0.89490634
0 references
0.87912107
0 references
0.8737217
0 references
