1981Fundamenta InformaticaeRequires access

On Eliminating the λ-Rules from Simple Matrix Grammars

Georghe Paun

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Embedded pushdown automaton, Indexed grammar, L-attributed grammar, Phrase structure grammar, Tree-adjoining grammar, Context-free grammar, Simple (philosophy), Context-sensitive grammar

Related papers

Back to paper searchBrowse research topicsOriginal source
On Eliminating the λ-Rules from Simple Matrix Grammars — Research Paper | ScholarLens