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.

Restarting automaton is a special type of a linear bounded automaton designed for modelling the so-called analysis by reduction. We use genetic algorithms to learn restarting automata to recognize languages according to input consisting of sets of positive and negative examples of words from the language together with positive and negative examples of simplifications.

The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.

Several radio galaxies are known that show radio morphological signatures that are best interpreted as restarting of nuclear activity after a period of quiescence. The conditions surrounding the phenomenon of nuclear recurrence are not understood. In this paper we have attempted to address this question by examining the nuclear fuelling characteristics in a sample of restarting radio galaxies. ...

It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.