75 search results - page 6 / 15 » Distributed Laboratories: A Finite State Machine Module |
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...
CSREASAM
2004
13 years 8 months ago
2004
We model a private key's life cycle as a finite state machine. The states are the key's phases of life and the transition functions describe tasks to be done with the key...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...