688 search results - page 1 / 138 » Types for trees |
DM
2008
13 years 5 months ago
2008
A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2...
JCT
2006
13 years 4 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
PROCOMET
1998
13 years 6 months ago
1998
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating -terms (B
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
PLANX
2007
13 years 6 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...