FIXED BLOTS IN TOLERANCE AUTOMATA
M.W. WARNER
(Department of Mathematics, The City University, Northampton Square, London EC1V 0HB (England))
17
Abstract
We prove that every input chain of a finite l‐tolerance automaton with inertia whose state space has a non‐zero Euler characteristic has a fixed blot, i.e. maps to itself a set Σ of states with the property that every state of Σ is within tolerance of, or “indistinguishable” from, a given state.
Citation
WARNER, M.W. (1980), "FIXED BLOTS IN TOLERANCE AUTOMATA", Kybernetes, Vol. 9 No. 3, pp. 193-195. https://doi.org/10.1108/eb005556
Publisher
:MCB UP Ltd
Copyright © 1980, MCB UP Limited