7 resultados para PROBABILISTIC TELEPORTATION
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
An application of the heterogeneous variables system prediction method to solving the time series analysis problem with respect to the sample size is considered in this work. It is created a logical-and-probabilistic correlation from the logical decision function class. Two ways is considered. When the information about event is kept safe in the process, and when it is kept safe in depending process.
Resumo:
The problem of finite automata minimization is important for software and hardware designing. Different types of automata are used for modeling systems or machines with finite number of states. The limitation of number of states gives savings in resources and time. In this article we show specific type of probabilistic automata: the reactive probabilistic finite automata with accepting states (in brief the reactive probabilistic automata), and definitions of languages accepted by it. We present definition of bisimulation relation for automata's states and define relation of indistinguishableness of automata states, on base of which we could effectuate automata minimization. Next we present detailed algorithm reactive probabilistic automata’s minimization with determination of its complexity and analyse example solved with help of this algorithm.
Resumo:
2000 Mathematics Subject Classification: 60J80.
Resumo:
2000 Mathematics Subject Classification: 78A50
Resumo:
2000 Mathematics Subject Classification: 94A29, 94B70
Resumo:
2000 Mathematics Subject Classification: 54H25, 47H10.
Resumo:
2000 Mathematics Subject Classification: Primary 60J45, 60J50, 35Cxx; Secondary 31Cxx.