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

DOI10.1515/DMA-2021-0034MaRDI QIDQ2064381zbMATH OpenOpenAlexFDO

Authors I. 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)

Recommendations

• scientific article; zbMATH DE number 1245629
• scientific article; zbMATH DE number 3854423
• Ergodicity of one locally interacting system of automata
• scientific article; zbMATH DE number 3868623
• On conditional stability of autonomous stochastic sequences of machines

Cites work

• scientific article; zbMATH DE number 1245621 (Why is no real title available?)
• scientific article; zbMATH DE number 1245623 (Why is no real title available?)
• scientific article; zbMATH DE number 1245629 (Why is no real title available?)
• The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain

Cited in

(2)

• Ergodicity of one locally interacting system of automata
• scientific article; zbMATH DE number 3854423 (Why is no real title available?)

This page was built for publication: Ergodicity of the probabilistic converter, a serial connection of two automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064381)