Probabilistic timed automata are classical extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic automata, a variant of in which transition probabilities can depend linearly on clock values. Clock-dependent allow the modelling continuous relationship between time passage and likelihood system events. show that problem deciding whether maximum re...

We consider the problem of searching labyrinths by colletives independent automata and show that for such it is possible to construct, using reduction automata, traps various types even in class all finite mosaic labyrinths.

Unambiguous automata are nondeterministic in which every word has at most one accepting run. In this paper we give a polynomial-time algorithm for model checking discrete-time Markov chains against ω-regular specifications represented as unambiguous automata. We furthermore show that the complexity of problem lies NC: subclass P comprising those problems solvable poly-logarithmic parallel time....

Weighted automata map input words to values, and have numerous applications in computer science. A result by Krob from the 90s implies that universality problem is decidable for weighted over tropical semiring with weights N ? { ? } undecidable when are Z . We continue study of borders decidability semiring. give a complete picture complexity various decision problems them, including non-emptin...

Abstract We show the decidability of finite sequentiality problem for unambiguous max-plus tree automata. A automaton is called if there at most one accepting run on every tree. The asks whether a given automaton, exist finitely many deterministic automata whose pointwise maximum equivalent to automaton.

Abstract We present new results on the computational limitations of affine automata (AfAs). First, we show that using endmarker does not increase power AfAs. Second, computation bounded-error rational-valued AfAs can be simulated in logarithmic space. Third, identify some logspace unary languages are recognized by algebraic-valued Fourth, arbitrary real-valued transition matrices and state vect...

We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products and abelian groups: after introducing enriched automata (i.e., with extra labels), we obtain an explicit bijection between a certain type such automata, which - it happens in group is computable finitely generated case. This approach provides neat geometric description (even non gener...