Abstract
We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis.
The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures capture the correspondence of dependency trees on different layers of linguistic description, namely the layer of surface syntax and the layer of language meaning.
The novelty of this contribution consists in the formal extension of restarting automata in order to produce tree structures with several interlinked layers and in the application of these automata to the stratificational description of a natural language.