On bounded interpretations of grammar forms

Erzsébet Csuhaj-Varjú, Jürgen Dassow

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

An interpretation of a grammar form is called (k, i)-bounded iff all its nonterminals are substituted by at most k symbols and all its terminals are replaced by at most i words. The (k, i)-bounded grammar family of a grammar form is the collection of its (k, i)-bounded interpretations, and its (k, i)-bounded grammatical family is the corresponding family of languages. The paper gives basic properties of these families. Especially, we show the decidability of the equivalence problem for bounded grammar families, the undecidability of the membership problem for bounded language families and give some hierarchy, closure and descriptional complexity results. Finally, some consequences in normal form theory of context-free languages are presented.

Original languageEnglish
Pages (from-to)287-313
Number of pages27
JournalTheoretical Computer Science
Volume87
Issue number2
DOIs
Publication statusPublished - Sep 23 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On bounded interpretations of grammar forms'. Together they form a unique fingerprint.

  • Cite this