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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference71 articles.
1. Tessellation Automata
2. Stochastic processes in several dimensions;Whittle;Bull. Inst. Internat. Statist.,1963
3. Random systems of locally interacting cells;Tautu;3rd Conf. Stoch. Proc. Appl. Sheffield.,1973
4. Stochastic programmed grammars for syntactic pattern recognition
5. On asynchronous stochastic automata