11 search results - page 2 / 3 » The Power of Commuting with Finite Sets of Words |
JUCS
2002
13 years 7 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
TCS
2010
13 years 5 months ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
AFL
2011
12 years 7 months ago
2011
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
FS
2006
13 years 7 months ago
2006
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...