106
click to vote
DLT
15 years 1 months ago
2008 
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of ...
DLT
15 years 1 months ago
2008 
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
86
Voted
DLT
15 years 1 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
103
Voted
DLT
15 years 1 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
|
Theoretical Computer Science