423 search results - page 47 / 85 » The Generalization of Generalized Automata: Expression Autom... |
AAAI
2010
13 years 10 months ago
2010
Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advant...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
WOLLIC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
WMP
2000
14 years 7 days ago
2000
orms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages . . . . 135 Manfred Kudlek, Victor Mitrana On Multisets in Database Systems . . ....
CLIN
2003
13 years 10 months ago
2003
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm...