We present three possible approaches to a homology theory of automata. Two of these require the state to possess a tolerance. This permits us to proceed by analogy with either the simplicial or the cubical theories of the topological category. The third approach describes a homology theory of automata as such.
Fixed simplex theorems are stated. It is suggested that homology theory might be used to classify automata.
