... automaton is a member of the set of “k-limited automata,” whose state function is determined by the last k symbols of input sequence. Clearly, not every finite automaton is a k-limited autom- ... autom- aton (reference 4, pp. 333-34.) N. Those k-limited automata for which k = 1 are called by Ginsburg “completely sequential machines.”16 Clearly, not every k-limited automaton is 1-limited. ... grammars. Context-free grammars have been shown to be weakly equivalent to normal grammars (which have rules of only the forms A → BC and A → a, for a∈VT, and thus represent binary trees1,4),...