Abstract
t-contextual grammars with regular selection are considered for which all t insertions are performed in the same neighbourhood. The languages generated by these grammars are accepted by restarting automata with cut-index t.
Here the classes of languages accepted by certain variants of restarting automata with limited cut-index are studied.
