Memory minimisation in control with stochastic automata

Memory minimisation in control with stochastic automata

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Stochastic automata have been shown to require less states than deterministic automata in the solution of certain recognition and hypothesis-testing problems. This letter extends the result to a class of control problems involving the regulation of a discrete dynamical system.


    1. 1)
      • M.A. Arbib . A common framework for automata theory and control theory. SIAM J. Contr. , 206 - 222
    2. 2)
      • N.P. Bhatia , G.P. Szego . (1967) , Dynamical systems: stability theory and applications.
    3. 3)
      • B.R. Gaines . (1969) Stochastic computing systems, Advances in information systems science 2.
    4. 4)
      • M.E. Hellman , T.M. Cover . On memory saved by randomization. Ann. Math. Stat. , 1075 - 1078
    5. 5)
      • H.J. Kushner . (1967) , Stochastic stability and control.
    6. 6)
      • E.F. Moore . (1956) Gedanken experiments on sequential machines, Automata studies.
    7. 7)
      • M.O. Rabin . Probabilistic automata. Inf. & Contr. , 230 - 245

Related content

This is a required field
Please enter a valid email address