Variants of competence-based derivations in CD grammar systems

E. Csuhaj-Varjú, Jürgen Dassow, György Vaszil

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.

Original languageEnglish
Pages (from-to)549-569
Number of pages21
JournalInternational Journal of Foundations of Computer Science
Volume21
Issue number4
DOIs
Publication statusPublished - Aug 2010

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Variants of competence-based derivations in CD grammar systems. / Csuhaj-Varjú, E.; Dassow, Jürgen; Vaszil, György.

In: International Journal of Foundations of Computer Science, Vol. 21, No. 4, 08.2010, p. 549-569.

Research output: Contribution to journalArticle

@article{8ca10ec7c38244b1a1602fc4968184a5,
title = "Variants of competence-based derivations in CD grammar systems",
abstract = "In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.",
author = "E. Csuhaj-Varj{\'u} and J{\"u}rgen Dassow and Gy{\"o}rgy Vaszil",
year = "2010",
month = "8",
doi = "10.1142/S0129054110007428",
language = "English",
volume = "21",
pages = "549--569",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Variants of competence-based derivations in CD grammar systems

AU - Csuhaj-Varjú, E.

AU - Dassow, Jürgen

AU - Vaszil, György

PY - 2010/8

Y1 - 2010/8

N2 - In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.

AB - In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.

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

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

U2 - 10.1142/S0129054110007428

DO - 10.1142/S0129054110007428

M3 - Article

VL - 21

SP - 549

EP - 569

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 4

ER -