Hardest languages for conjunctive and Boolean grammars

Research output

Abstract

A famous theorem by Greibach (“The hardest context-free language”, SIAM J. Comp., 1973) states that there exists such a context-free language L 0 , that every context-free language over any alphabet is reducible to L 0 by a homomorphic reduction—in other words, is representable as its inverse homomorphic image h −1 (L 0 ), for a suitable homomorphism h. This paper establishes similar characterizations for conjunctive grammars, that is, for grammars extended with a conjunction operator, as well as for Boolean grammars, which are further equipped with a negation operator. At the same time, it is shown that no such characterization is possible for several subclasses of linear grammars.

Original languageEnglish
Pages (from-to)1-18
Number of pages18
JournalInformation and Computation
Volume266
DOIs
Publication statusPublished - 1 Jun 2019

    Fingerprint

Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this