Descriptional complexity of context-free grammar forms

E. Csuhaj-Varjú, Alica Kelemenová

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEIG, LEVG, VARG, PRODG and DEPG 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.

Original languageEnglish
Pages (from-to)277-289
Number of pages13
JournalTheoretical Computer Science
Volume112
Issue number2
DOIs
Publication statusPublished - May 10 1993

Fingerprint

Descriptional Complexity
Context free grammars
Context-free Grammar
Grammar
Complexity Measure
Form
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Descriptional complexity of context-free grammar forms. / Csuhaj-Varjú, E.; Kelemenová, Alica.

In: Theoretical Computer Science, Vol. 112, No. 2, 10.05.1993, p. 277-289.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E. ; Kelemenová, Alica. / Descriptional complexity of context-free grammar forms. In: Theoretical Computer Science. 1993 ; Vol. 112, No. 2. pp. 277-289.
@article{34b3639969cf4d67837c7ec1fd878876,
title = "Descriptional complexity of context-free grammar forms",
abstract = "Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEIG, LEVG, VARG, PRODG and DEPG 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.",
author = "E. Csuhaj-Varj{\'u} and Alica Kelemenov{\'a}",
year = "1993",
month = "5",
day = "10",
doi = "10.1016/0304-3975(93)90021-K",
language = "English",
volume = "112",
pages = "277--289",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Descriptional complexity of context-free grammar forms

AU - Csuhaj-Varjú, E.

AU - Kelemenová, Alica

PY - 1993/5/10

Y1 - 1993/5/10

N2 - Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEIG, LEVG, VARG, PRODG and DEPG 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.

AB - Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEIG, LEVG, VARG, PRODG and DEPG 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.

UR - http://www.scopus.com/inward/record.url?scp=0027594162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027594162&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(93)90021-K

DO - 10.1016/0304-3975(93)90021-K

M3 - Article

AN - SCOPUS:0027594162

VL - 112

SP - 277

EP - 289

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -