16430 search results - page 366 / 3286 » On Computable Tree Functions |
141
click to vote
LICS
2008
IEEE
16 years 16 days ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
165
Voted
ISMDA
2005
Springer
15 years 11 months ago
2005
Springer
Over recent years the field of phylogenetics has witnessed significant algorithmic and technical progress. A new class of efficient phylogeny programs allows for computation of l...
166
Voted
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
164
Voted
FOSSACS
2003
Springer
15 years 11 months ago
2003
Springer
We define an operational semantics and a type system for manipulating semistructured data that contains hidden information. The data model is simple labeled trees with a hiding op...
161
Voted
ACL
2008
15 years 7 months ago
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...