Descriptional complexity of context-free grammar forms

Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEI G , LEV G , VAR G , PROD G and DEP G related to any appropriate infinite class G of grammars are unbounded on the infinite class of languages determined by strict/general interpretatio...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 112; no. 2; pp. 277 - 289
Main Authors Csuhaj-Varju, Erzsebet, Kelemenova, Alica
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 10.05.1993
Elsevier
Subjects
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Language theory and syntactical analysis
Theoretical computing
Formal language
Context free grammar
Context free language
Language theory
Complexity
Online AccessGet full text

Cover

More Information
Summary:Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEI G , LEV G , VAR G , PROD G and DEP G related to any appropriate infinite class G of grammars are unbounded on the infinite class of languages determined by strict/general interpretations of any infinite grammar form.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(93)90021-K