28 search results - page 5 / 6 » Query Automata for Nested Words |
COLT
1994
Springer
13 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
CONCUR
2006
Springer
13 years 9 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...
DKE
2007
13 years 7 months ago
2007
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
JUCS
2010
13 years 2 months ago
2010
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...