662 search results - page 63 / 133 » Trees, Automata and XML |
241
click to vote
DCC
2011
IEEE
15 years 19 days ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
148
click to vote
DSOM
2004
Springer
15 years 11 months ago
2004
Springer
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
180
click to vote
IWPC
2002
IEEE
15 years 11 months ago
2002
IEEE
A means to add explicit structure to program source code is presented. XML is used to augment source code with syntactic information from the parse tree. More importantly, comment...
182
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...