3 search results - page 1 / 1 » Regular Inference for State Machines Using Domains with Equa... |
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 ...
FASE
2006
Springer
13 years 9 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
ISOLA
2007
Springer
14 years 9 days ago
2007
Springer
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...