10 search results - page 1 / 2 » Automata techniques for query inference machines |
APAL
2002
13 years 9 months ago
2002
FASE
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
CONCUR
2006
Springer
13 years 11 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...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
ICVS
2003
Springer
14 years 3 months ago
2003
Springer
This paper presents an extensible architectural model for general content-based analysis and indexing of video data which can be customised for a given problem domain. Video interp...