34 search results - page 7 / 7 » A characterization of fine words over a finite alphabet |
ALMOB
2006
13 years 7 months ago
2006
Background: In order to compute pattern statistics in computational biology a Markov model is commonly used to take into account the sequence composition. Usually its parameter mu...
DLT
2010
13 years 8 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
AUTOMATICA
2008
13 years 7 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
SIAMAM
2008
13 years 7 months ago
2008
Abstract. We develop a partial equilibrium model to investigate the problem of optimal liquidation over a finite or infinite time horizon for an investor with large holdings in a r...