On a new family of automata

This paper introduces a new family of automata that turns out to be computationally equivalent to linear conjunctive grammars. Although, if viewed as a practical tool for describing practical languages, these automata are not nearly as convenient as linear conjunctive grammars are, they can be reasonably expected to be highly suitable for use in applications as a low-level computational model, due to low computational complexity and the extreme simplicity of their implementation.