54 search results - page 2 / 11 » Inference of Finite Automata Using Homing Sequences |
WIA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We use them to model musical styles: a same automaton can be used to...
ACSC
2002
IEEE
13 years 11 months ago
2002
IEEE
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
GRC
2005
IEEE
13 years 12 months ago
2005
IEEE
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...
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...
FASE
2008
Springer
13 years 8 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 ...