50 search results - page 9 / 10 » Regular Languages Are Testable with a Constant Number of Que... |
CONNECTION
2008
13 years 6 months ago
2008
Spoken language is one of the most intuitive forms of interaction between humans and agents. Unfortunately, agents that interact with people using natural language often experienc...
FOCS
2008
IEEE
14 years 14 days ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
CONCUR
2006
Springer
13 years 8 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...
PODS
2007
ACM
14 years 6 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
PLDI
2010
ACM
13 years 11 months ago
2010
ACM
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...