231 search results - page 10 / 47 » A Parallel State Assignment Algorithm for Finite State Machi... |
ICDAR
2007
IEEE
14 years 1 months ago
2007
IEEE
With the increasing market of cheap cameras, natural scene text has to be handled in an efficient way. Some works deal with text detection in the image while more recent ones poi...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
ASE
2010
13 years 7 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
FASE
2008
Springer
13 years 9 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 11 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...