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.
Keywords:Mealy automaton, output-free automaton, automaton extension, substitution automaton, serial connection of automata, probabilistic converter, ergodicity of probabilistic converter, indecomposable and aperiodic matrices, completely indecomposable matrices.
Fulltext:
PDF file (416 kB)