Abstract
The problem of finding a stochastic sequential machine with minimal number of states and homomorphic to a given machine is studied in various aspects. The methods used for investigating the above problem are based upon the properties of a certain convex polyhedron associated with the given machine.
Similar content being viewed by others
References
G. C. Bacon, “Minimal-state stochastic finite-state systems”,IEEE Trans. Circuit Theory CT-11, June 1964, pp. 307–308.
J. W. Carlyle, “Stochastic finite-state system theory”, inSystem Theory, L. A. Zadeh and E. Polak, Editors, Ch. 10, McGraw-Hill (in press).
S. Even, “Comments on the minimization of stochastic machines”,IEEE Transactions on E. C., Vol. 14, No. 4, 1965, pp. 634–637.
B. Grünbaum,Convex Polytopes, Interscience, 1967.
E. H. Ott, “Theory and applications of stochastic sequential machines”,Sperry Rand Research Center, Report No. SRRC-RR-66-39, May 1966.
E. H. Ott, “Reconsider the state minimization problem for stochastic finite state systems”,IEEE conference record of the seventh annual symposium on switching and automata theory, October 1966, pp. 267–273.
A. Paz, “Minimization theorems and techniques for sequential stochastic machines”,Information and Control 11 (1967), 156–166.
Author information
Authors and Affiliations
Additional information
The research reported herein was supported by the Air Force Office of Scientific Research, Office of Aerospace Research, United States Air Force under AFOSR Grant AFAFOSR-639-67.
On leave from Technion, Israel Institute of Technology, Haifa, Israel.
Rights and permissions
About this article
Cite this article
Paz, A. Homomorphisms between stochastic sequential machines and related problems. Math. Systems Theory 2, 223–245 (1968). https://doi.org/10.1007/BF01694007
Issue Date:
DOI: https://doi.org/10.1007/BF01694007