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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
