Sciweavers

60
Voted
WIA
2005
Springer
15 years 2 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
FOSSACS
2009
Springer
15 years 3 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...