2467 search results - page 176 / 494 » Finite State Machines |
142
click to vote
RP
2010
Springer
15 years 4 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
133
click to vote
WSC
2000
15 years 8 months ago
2000
An advanced processing machine interacts with the material handling system, personnel and cell or shop floor controller in real-time via messaging and control. However, current si...
163
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...
166
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
162
click to vote
ICANN
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, it will be shown that it is feasible to extract finite state machines in a domain of, for rule extraction, previously unencountered complexity. The algorithm used i...