To read this content please select one of the options below:

(excl. tax) 30 days to view and download

FIXED BLOTS IN TOLERANCE AUTOMATA

M.W. WARNER

Kybernetes

ISSN: 0368-492X

Article publication date: 1 March 1980

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

Related articles