Ergodicity of the probabilistic converter, a serial connection of two automata

DOI10.1515/dma-2021-0034OpenAlexW4285507888MaRDI QIDQ2064381

Igor A. Kruglov

Publication date: 5 January 2022

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2021-0034

zbMATH Keywords

automaton extensioncompletely indecomposable matricesergodicity of probabilistic converterindecomposable and aperiodic matricesmealy automatonoutput-free automatonprobabilistic converterserial connection of automatasubstitution automaton

Mathematics Subject Classification ID

Computer science (68-XX) Systems theory; control (93-XX)

Cites Work

• The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain
• Unnamed Item
• Unnamed Item
• Unnamed Item