38 search results - page 5 / 8 » Restricted Walks in Regular Trees |
PODS
2005
ACM
14 years 5 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
CAAN
2006
Springer
13 years 9 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
APBC
2004
13 years 7 months ago
2004
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
CONCUR
2006
Springer
13 years 7 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...