FIXED BLOTS IN TOLERANCE AUTOMATA
M.W. Warner · Kybernetes · 1980
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.