CD grammar systems with competence based entry conditions in their cooperation protocols

E. Csuhaj-Varjú, Jürgen Dassow, Markus Holzer

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper we examine context-free cooperating distributed (CD) grammar systems where the cooperation protocol is based on the competence (capability) of the component grammars in rewriting. We study the power of a derivation mode where every component is allowed to start the generation only if it has a prescribed level of competence and it is allowed to finish the work if it is not competent anymore. The competence level of a component on a string is the number of different nonterminals in this word that can be rewritten by the production set of the grammar. We show that if the prescribed level of competence of the grammar to start the derivation is equal to k or is at least k, for some natural number k ≥ 2, then these CD grammar systems are as powerful as the ET0L systems with random context conditions. If this competence level is exactly one, or at least one, or it is at most k, where k ≥ 2, then the class of ET0L languages is determined by these constructions.

Original languageEnglish
Pages (from-to)159-169
Number of pages11
JournalInternational Journal of Computer Mathematics
Volume83
Issue number2
DOIs
Publication statusPublished - Feb 1 2006

Fingerprint

Grammar
Rewriting
Natural number
Strings
Context

Keywords

  • Competence
  • Distribution
  • Grammar systems: Cooperation

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

CD grammar systems with competence based entry conditions in their cooperation protocols. / Csuhaj-Varjú, E.; Dassow, Jürgen; Holzer, Markus.

In: International Journal of Computer Mathematics, Vol. 83, No. 2, 01.02.2006, p. 159-169.

Research output: Contribution to journalArticle

@article{6c37b3a296e74b8590ccb1c0738c5998,
title = "CD grammar systems with competence based entry conditions in their cooperation protocols",
abstract = "In this paper we examine context-free cooperating distributed (CD) grammar systems where the cooperation protocol is based on the competence (capability) of the component grammars in rewriting. We study the power of a derivation mode where every component is allowed to start the generation only if it has a prescribed level of competence and it is allowed to finish the work if it is not competent anymore. The competence level of a component on a string is the number of different nonterminals in this word that can be rewritten by the production set of the grammar. We show that if the prescribed level of competence of the grammar to start the derivation is equal to k or is at least k, for some natural number k ≥ 2, then these CD grammar systems are as powerful as the ET0L systems with random context conditions. If this competence level is exactly one, or at least one, or it is at most k, where k ≥ 2, then the class of ET0L languages is determined by these constructions.",
keywords = "Competence, Distribution, Grammar systems: Cooperation",
author = "E. Csuhaj-Varj{\'u} and J{\"u}rgen Dassow and Markus Holzer",
year = "2006",
month = "2",
day = "1",
doi = "10.1080/00207160500113355",
language = "English",
volume = "83",
pages = "159--169",
journal = "International Journal of Computer Mathematics",
issn = "0020-7160",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - CD grammar systems with competence based entry conditions in their cooperation protocols

AU - Csuhaj-Varjú, E.

AU - Dassow, Jürgen

AU - Holzer, Markus

PY - 2006/2/1

Y1 - 2006/2/1

N2 - In this paper we examine context-free cooperating distributed (CD) grammar systems where the cooperation protocol is based on the competence (capability) of the component grammars in rewriting. We study the power of a derivation mode where every component is allowed to start the generation only if it has a prescribed level of competence and it is allowed to finish the work if it is not competent anymore. The competence level of a component on a string is the number of different nonterminals in this word that can be rewritten by the production set of the grammar. We show that if the prescribed level of competence of the grammar to start the derivation is equal to k or is at least k, for some natural number k ≥ 2, then these CD grammar systems are as powerful as the ET0L systems with random context conditions. If this competence level is exactly one, or at least one, or it is at most k, where k ≥ 2, then the class of ET0L languages is determined by these constructions.

AB - In this paper we examine context-free cooperating distributed (CD) grammar systems where the cooperation protocol is based on the competence (capability) of the component grammars in rewriting. We study the power of a derivation mode where every component is allowed to start the generation only if it has a prescribed level of competence and it is allowed to finish the work if it is not competent anymore. The competence level of a component on a string is the number of different nonterminals in this word that can be rewritten by the production set of the grammar. We show that if the prescribed level of competence of the grammar to start the derivation is equal to k or is at least k, for some natural number k ≥ 2, then these CD grammar systems are as powerful as the ET0L systems with random context conditions. If this competence level is exactly one, or at least one, or it is at most k, where k ≥ 2, then the class of ET0L languages is determined by these constructions.

KW - Competence

KW - Distribution

KW - Grammar systems: Cooperation

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

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

U2 - 10.1080/00207160500113355

DO - 10.1080/00207160500113355

M3 - Article

AN - SCOPUS:33646440726

VL - 83

SP - 159

EP - 169

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 2

ER -