Abstract
We study special types of automata for modelling some types of syntactical analysis based on forgetting and restarting. We show a taxonomy of relations between the Chomsky hierarchy and the classes of languages recognized by the new types of automata.