936 search results - page 92 / 188 » FSM-Hume is finite state |
UAI
2001
13 years 10 months ago
2001
We present a new method for estimating the expected return of a POMDP from experience. The estimator does not assume any knowledge of the POMDP, can estimate the returns for finit...
ACL
1998
13 years 10 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
COLING
1996
13 years 10 months ago
1996
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
SIGMETRICS
2002
ACM
13 years 8 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
RP
2010
Springer
13 years 6 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...