No CrossRef data available.
Article contents
A Stochastic Automaton Model for Interacting Systems
Published online by Cambridge University Press: 05 September 2017
Abstract
A stochastic tessellation automaton (STA) is introduced and analysed as an analogue to a stochastic lattice process, called the Markov configuration process. The STA is considered as an (infinite regular) array with interconnected Moore-type automata, each of these representing a B-object interacting with its neighbours. The objective of the paper is to examine some consequences of the analogy between an STA and the Markov configuration process. In addition, the possibility of finding a suitable stochastic grammar arising from the study of this configuration model is briefly considered.
- Type
- Part IX — Biomathematics and Epidemiology
- Information
- Copyright
- Copyright © 1975 Applied Probability Trust