Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars

  • Authors:

  • Henning Fernau;Rudolf Freund;Marion Oswald;Klaus Reinhardt

  • Affiliations:

  • Fachbereich IV, Abteilung Informatik, Universität Trier, Trier, Germnay;Institut für Coputersprachen, Fakultät für Informatik, Technische Universität Wien, Wien, Austria;Institut für Coputersprachen, Fakultät für Informatik, Technische Universität Wien, Wien, Austria;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Tübingen, Germany

  • Venue:
  • Journal of Automata, Languages and Combinatorics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We refine the classical notion of the nonterminal complexity of graph-controlled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable language can be generated by a graph-controlled grammar with only two nonterminal symbols when both symbols are used in the appearance checking mode. This result immediately implies that programmed grammars with three nonterminal symbols where two of them are used in the appearance checking mode as well as matrix grammars with three nonterminal symbols all of them used in the appearance checking mode are computationally complete. Moreover, we prove that matrix grammars with four nonterminal symbols with only two of them being used in the appearance checking mode are computationally complete, too. On the other hand, every language is recursive if it is generated by a graph-controlled grammar with an arbitrary number of nonterminal symbols but only one of the nonterminal symbols being allowed to be used in the appearance checking mode. This implies, in particular, that the result proving the computational completeness of graph-controlled grammars with two nonterminal symbols and both of them being used in the appearance checking mode is already optimal with respect to the overall number of nonterminal symbols as well as with respect to the number of nonterminal symbols used in the appearance checking mode, too. Finally, we also investigate in more detail the computational power of several language families which are generated by graph-controlled, programmed grammars or matrix grammars, respectively, with a very small number of nonterminal symbols and therefore are proper subfamilies of the family of recursively enumerable languages.