2 search results - page 1 / 1 » Branch-width, parse trees, and monadic second-order logic fo... |
JCT
2006
13 years 4 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
ACL
1997
13 years 5 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...