Representing Lumped Markov Chains by Minimal Polynomials over Field GF(<i>q</i>)

Zakharov, V. M.; Shalagin, S. V.; Eminov, B. F.

doi:10.1088/1742-6596/1015/3/032033

Cited by 6 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[7][8][9][10][11]). Востребованной задачей в этом направлении является задача построения АВМ для моделирования укрупненных и расширенных цепей Маркова (ЦМ) [14,[16][17][18]. Представление стохастических процессов в виде укрупненных ЦМ позволяет изучать сложный процесс методами цепей Маркова [14] и решать различные прикладные задачи [3,[19][20][21].…”

Section: Introductionunclassified

Method for Submitting Sets of Stochastic Matrices for Multi-parametric Analysis of Aggregated and Extended Markov’s Chains

Zakharov¹,

Shalagin²,

Eminov³

2020

HDSU

View full text Add to dashboard Cite

Section: Introductionunclassified

Method for Submitting Sets of Stochastic Matrices for Multi-parametric Analysis of Aggregated and Extended Markov’s Chains

Zakharov¹,

Shalagin²,

Eminov³

2020

HDSU

View full text Add to dashboard Cite

Representing Autonomous Probabilistic Automata by Minimum Characteristic Polynomials over a Finite Field

Zakharov

Shalagin

Eminov³

2021

Communications in Computer and Information Science

View full text Add to dashboard Cite

Algorithms for computing the sets of stochastic matrices with predefined properties, based on automaton models

Zakharov

Shalagin

Eminov

2019

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The formed sets of ergodic stochastic matrices are focused on solving the problem of classifying probabilistic automaton models by certain criteria/parameters of similarities or differences in the structures of ergodic stochastic matrices using the methods of applied multivariate mathematical statistics. The algorithms developed allow forming a variety of the sets of stochastic matrices through changing the transition and random entry function in a probabilistic automaton. Transition function of the autonomous probabilistic automaton allows using the probabilistic automaton operation algorithm proposed to form the sets of ergodic stochastic matrices that differ in their potencies and structures, based on implementing state set permutations with repetitions and changing the random input variable probability distributions. Defining various autonomous deterministic automaton output functions, we can use the algorithm developed to form the sets of ergodic stochastic matrices that differ in their potencies, with a specified limiting vector, based on implementing the permutations of a set of output letters with repetitions. We are also presenting the evaluations of the potencies of the sets of ergodic stochastic matrices with rational elements, represented by autonomous probabilistic automata under the given constraints.

show abstract

Representing Lumped Markov Chains by Minimal Polynomials over Field GF(q)

Cited by 6 publications

References 4 publications

Method for Submitting Sets of Stochastic Matrices for Multi-parametric Analysis of Aggregated and Extended Markov’s Chains

Method for Submitting Sets of Stochastic Matrices for Multi-parametric Analysis of Aggregated and Extended Markov’s Chains

Representing Autonomous Probabilistic Automata by Minimum Characteristic Polynomials over a Finite Field

Algorithms for computing the sets of stochastic matrices with predefined properties, based on automaton models

Contact Info

Product

Resources

About