12 search results - page 2 / 3 » MSO on the Infinite Binary Tree: Choice and Order |
103
click to vote
SIGMETRICS
2004
ACM
15 years 6 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
119
click to vote
COLING
1992
15 years 2 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
128
click to vote
JAPLL
2006
15 years 1 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
104
click to vote
TOIS
2002
15 years 1 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
102
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...