Pages that link to "Item:Q5444984"
From MaRDI portal
The following pages link to Complexity of Pebble Tree-Walking Automata (Q5444984):
Displayed 6 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)