Memory minimisation in control with stochastic automata

2 December 1971

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 7 (24) , 710-711
https://doi.org/10.1049/el:19710487

Abstract

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.

Keywords

CONTROL WITH STOCHASTIC AUTOMATA
DISCRETE DYNAMICAL SYSTEMS REGULATION
MEMORY MINIMISATION
MINIMISATION OF SWITCHING NETS
AUTOMATA THEORY
HYPOTHESIS TESTING PROBLEMS
RECOGNITION PROBLEMS
STOCHASTIC SYSTEMS

This publication has 3 references indexed in Scilit:

Stochastic Computing Systems
Published by Springer Nature ,1969
Dynamical Systems: Stability Theory and Applications
Lecture Notes in Mathematics, 1967
Gedanken-Experiments on Sequential Machines
Published by Walter de Gruyter GmbH ,1956