Scattered context grammars generate any recursively enumerable language with two nonterminals

Erzsébet Csuhaj-Varjú, György Vaszil

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

By showing that two nonterminals are sufficient, we present the optimal lower bound on the number of nonterminals of scattered context grammars being able to generate any recursively enumerable language.

Original languageEnglish
Pages (from-to)902-907
Number of pages6
JournalInformation Processing Letters
Volume110
Issue number20
DOIs
Publication statusPublished - Sep 30 2010

    Fingerprint

Keywords

  • Formal languages
  • Nonterminal complexity
  • Regulated rewriting
  • Scattered context grammars

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this