241 search results - page 4 / 49 » Learning Classes of Probabilistic Automata |
EGC
2005
Springer
14 years 24 days ago
2005
Springer
Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is...
CONCUR
2009
Springer
14 years 1 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
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...
SSPR
2004
Springer
14 years 21 days ago
2004
Springer
TSMC
2010
13 years 2 months ago
2010
The cellular learning automaton (CLA), which is a4 combination of cellular automaton (CA) and learning automaton5 (LA), is introduced recently. This model is superior to CA because...