The following pages link to Sebastian Maneth (Q269347):
Displayed 50 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Domains of partial attributed tree transducers (Q294731) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Definability results for top-down tree transducers (Q832950) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- The generating power of total deterministic tree transducers (Q1281500) (← links)
- Cooperating distributed hyperedge replacement grammars (Q1307849) (← links)
- A comparison of pebble tree transducers with macro tree transducers (Q1424364) (← links)
- A formal model for an expressive fragment of XSLT (Q1599655) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Item:Q269347 (redirect page) (← links)
- Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Deciding top-down determinism of regular tree languages (Q2140513) (← links)
- Static garbage collection (Q2177594) (← links)
- Deciding equivalence of separated non-nested attribute systems in polynomial time (Q2289099) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- (Q2767135) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations (Q2849905) (← links)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- How to Remove the Look-Ahead of Top-Down Tree Transducers (Q2921978) (← links)
- A strict border for the decidability of E-unification for recursive functions (Q2956722) (← links)
- Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete (Q3020012) (← links)
- (Q3165963) (← links)
- (Q3174911) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- Compressed Tree Canonization (Q3449487) (← links)
- Minimization of Deterministic Bottom-Up Tree Transducers (Q3584892) (← links)
- Multi-Return Macro Tree Transducers (Q3602805) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
- (Q4236234) (← links)
- (Q4259969) (← links)
- (Q4260711) (← links)
- (Q4415261) (← links)
- Macro Tree Translations of Linear Size Increase are MSO Definable (Q4429669) (← links)
- (Q4473157) (← links)
- (Q4501561) (← links)
- (Q4502802) (← links)
- Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable (Q4561509) (← links)