On Eliminating the λ-Rules from Simple Matrix Grammars
Georghe Paun
Abstract
Georghe Paun
Abstract
It is proved that the λ-rules increase the generative capacity of context-free simple matrix grammars but can be eliminated from right-linear simple matrix grammars and from linear simple matrix grammars without diminishing their generative capacity.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is proved that the λ-rules increase the generative capacity of context-free simple matrix grammars but can be eliminated from right-linear simple matrix grammars and from linear simple matrix grammars without diminishing their generative capacity.
Key concepts: Embedded pushdown automaton, Indexed grammar, L-attributed grammar, Phrase structure grammar, Tree-adjoining grammar, Context-free grammar, Simple (philosophy), Context-sensitive grammar