Memory minimisation in control with stochastic automata
作者： B.R. Gaines
DOI: 10.1049/EL:19710487
关键词: Stochastic cellular automaton 、 ω-automaton 、 Stochastic automata 、 Quantum finite automata 、 Discrete mathematics 、 Automata theory 、 Discrete dynamical system 、 Theoretical computer science 、 Mathematics 、 Minimisation (clinical trials) 、 Automaton
摘要: Stochastic automata have been shown to require less states than deterministic in the solution of certain recognition and hypothesis-testing problems. This letter extends result a class control problems involving regulation discrete dynamical system.
harvard.edu
sci-hub.se 参考文章(7)
G. P. Szegö, N. P. Bhatia, Dynamical Systems: Stability, Theory and Applications ,(1967)
Harold J. Kushner, Stochastic Stability and Control ,(2012)
Michael A. Arbib, A Common Framework for Automata Theory and Control Theory Journal of the Society for Industrial and Applied Mathematics Series A Control. ,vol. 3, pp. 206- 222 ,(1965) , 10.1137/0303017
Martin E. Hellman, Thomas M. Cover, On Memory Saved by Randomization Annals of Mathematical Statistics. ,vol. 42, pp. 1075- 1078 ,(1971) , 10.1214/AOMS/1177693334
B. R. Gaines, Stochastic Computing Systems Advances in Information Systems Science. pp. 37- 172 ,(1969) , 10.1007/978-1-4899-5841-9_2
Edward F. Moore, Gedanken-Experiments on Sequential Machines Princeton University Press. ,(1956) , 10.1515/9781400882618-006
N. P. Bhatia, G. P. Szegö, Dynamical Systems: Stability Theory and Applications Lecture Notes in Mathematics. ,(1967) , 10.1007/BFB0080630