Ergodicity of the probabilistic converter, a serial connection of two automata
-
Igor A. Kruglov
Abstract
The paper provides necessary and sufficient conditions for the the ergodicity of a serial connection of automata under which the output sequence of a substitution Mealy automaton is fed to the input of an output-free substitution automaton. It is shown that the condition of complete indecomposability of the state transition probability matrix of a Mealy automaton provides a sufficient condition for ergodicity of the probabilistic converter as a serial connection of automata. It is also shown that if the partial state transition functions of a Mealy automaton commute, then the condition of ergodicity of a serial connection is equivalent to that of both original probabilistic converters.
Note: Originally published in Diskretnaya Matematika (2020) 32,№3, 38–48 (in Russian).
References
[1] Sachkov V. N., “Probabilistic converters and regular multigraphs. I”, Trudy po Diskretnoi Matematike, 1, TVP, Moscow, 1997, 227–250 (in Russian).Search in Google Scholar
[2] Gorchinskii Yu. N., Kruglov I. A., Kapitonov V. M., “Questions of the theory of distributions on finite groups”, Trudy po Diskretnoi Matematike, 1 (1997), 85–112 (in Russian).Search in Google Scholar
[3] Sachkov V. N., A course in combinatorial analysis, Regular and Chaotic Dynamics, Moscow, Izhevsk, 2013 (in Russian).Search in Google Scholar
[4] Kruglov I. A., “The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain”, Discrete Math. Appl., 18:1 (2008), 41–55.10.1515/DMA.2008.003Search in Google Scholar
[5] Glukhov M. M., “On numerical parameters associated with the definition of finite groups by systems of generating elements”, Trudy po Diskretnoi Matematike, 1, TVP, Moscow, 1997,43–66 (in Russian).Search in Google Scholar
[6] Sarymsakov T. A., Elements of the theory of Markov processes, GITTL, Moscow, 1954 (in Russian).Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- A method of construction of differentially 4-uniform permutations over Vm for even m
- Ergodicity of the probabilistic converter, a serial connection of two automata
- On distance-regular graphs with c2 = 2
- Minimal contact circuits for characteristic functions of spheres
- Approximation of restrictions of q-valued logic functions to linear manifolds by affine analogues
- Multiaffine polynomials over a finite field
- Large deviations of branching process in a random environment. II
Articles in the same Issue
- Frontmatter
- A method of construction of differentially 4-uniform permutations over Vm for even m
- Ergodicity of the probabilistic converter, a serial connection of two automata
- On distance-regular graphs with c2 = 2
- Minimal contact circuits for characteristic functions of spheres
- Approximation of restrictions of q-valued logic functions to linear manifolds by affine analogues
- Multiaffine polynomials over a finite field
- Large deviations of branching process in a random environment. II
