Automata with restart operation (henceforth RA) constitute an interesting class of acceptors and reduction systems at the same time, and simultaneously display a remarkable ’explicative power’ wrt. the analysis of formal and natural languages. This paper focuses on RA as a formal-theoretical tool for modelling the analysis by reduction of natural languages and on the role of analysis by reducti...
