Abstract
It is shown that every stochastic automaton generates a semigroup of continuous linear operators in order to give conditions for the convergence of certain operators connected with infinite input sequences. The main results of this note are conditions for the infinitesimal stability of stochastic automata. Since under suitable conditions the behaviour of a learning system can be represented by a stochastic automaton, these results apply to the asymptotic stability of learning.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
