We generalize the class of sofic subshifts, which correspond to regular lan
guages, to subshifts accepted by either nondeterministic or deterministic T
uring machines in real time. We show that every substitutive system can be
accepted by a deterministic Turing machine in real time. (C) 2000 Elsevier
Science B.V. All rights reserved.