Cooperating distributed grammar systems

Components with nonincreasing competence

Maurice H. Ter Beek, E. Csuhaj-Varjú, Markus Holzer, György Vaszil

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form - and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincreasing in competence works in =k-competence mode of derivation if no k-competent component can ever become l-competent, for some l∈>∈k. We introduce a static and a dynamic definition to impose this restriction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various k, with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages70-89
Number of pages20
Volume6610
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6610
ISSN (Print)03029743
ISSN (Electronic)16113349

Fingerprint

Grammar
Context-free Grammar
Rewriting
Strings
Restriction
Context
Form

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ter Beek, M. H., Csuhaj-Varjú, E., Holzer, M., & Vaszil, G. (2011). Cooperating distributed grammar systems: Components with nonincreasing competence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6610, pp. 70-89). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6610). https://doi.org/10.1007/978-3-642-20000-7_7

Cooperating distributed grammar systems : Components with nonincreasing competence. / Ter Beek, Maurice H.; Csuhaj-Varjú, E.; Holzer, Markus; Vaszil, György.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6610 2011. p. 70-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6610).

Research output: Chapter in Book/Report/Conference proceedingChapter

Ter Beek, MH, Csuhaj-Varjú, E, Holzer, M & Vaszil, G 2011, Cooperating distributed grammar systems: Components with nonincreasing competence. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6610, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6610, pp. 70-89. https://doi.org/10.1007/978-3-642-20000-7_7
Ter Beek MH, Csuhaj-Varjú E, Holzer M, Vaszil G. Cooperating distributed grammar systems: Components with nonincreasing competence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6610. 2011. p. 70-89. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-20000-7_7
Ter Beek, Maurice H. ; Csuhaj-Varjú, E. ; Holzer, Markus ; Vaszil, György. / Cooperating distributed grammar systems : Components with nonincreasing competence. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6610 2011. pp. 70-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inbook{9b9db83849184fd0953ab4b25471759d,
title = "Cooperating distributed grammar systems: Components with nonincreasing competence",
abstract = "We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form - and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincreasing in competence works in =k-competence mode of derivation if no k-competent component can ever become l-competent, for some l∈>∈k. We introduce a static and a dynamic definition to impose this restriction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various k, with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking.",
author = "{Ter Beek}, {Maurice H.} and E. Csuhaj-Varj{\'u} and Markus Holzer and Gy{\"o}rgy Vaszil",
year = "2011",
doi = "10.1007/978-3-642-20000-7_7",
language = "English",
isbn = "9783642199998",
volume = "6610",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "70--89",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

T1 - Cooperating distributed grammar systems

T2 - Components with nonincreasing competence

AU - Ter Beek, Maurice H.

AU - Csuhaj-Varjú, E.

AU - Holzer, Markus

AU - Vaszil, György

PY - 2011

Y1 - 2011

N2 - We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form - and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincreasing in competence works in =k-competence mode of derivation if no k-competent component can ever become l-competent, for some l∈>∈k. We introduce a static and a dynamic definition to impose this restriction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various k, with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking.

AB - We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form - and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincreasing in competence works in =k-competence mode of derivation if no k-competent component can ever become l-competent, for some l∈>∈k. We introduce a static and a dynamic definition to impose this restriction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various k, with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking.

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

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

U2 - 10.1007/978-3-642-20000-7_7

DO - 10.1007/978-3-642-20000-7_7

M3 - Chapter

SN - 9783642199998

VL - 6610

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 70

EP - 89

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -