On competence in CD grammar systems

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

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (≤k-, ≥k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.

Original languageEnglish
Pages (from-to)76-88
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3340
Publication statusPublished - 2004

Fingerprint

Context free languages
Grammar
Mental Competency
Computer Communication Networks
Language
Network protocols
Context-free Languages
Rewriting
Open Problems
Strings
Context
Form
Family

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

On competence in CD grammar systems. / Ter Beek, Maurice H.; Csuhaj-Varjú, E.; Holzer, Markus; Vaszil, György.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3340, 2004, p. 76-88.

Research output: Contribution to journalArticle

@article{baab910f5b544581b91ffa4c6ce57029,
title = "On competence in CD grammar systems",
abstract = "We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (≤k-, ≥k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.",
author = "{Ter Beek}, {Maurice H.} and E. Csuhaj-Varj{\'u} and Markus Holzer and Gy{\"o}rgy Vaszil",
year = "2004",
language = "English",
volume = "3340",
pages = "76--88",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - On competence in CD grammar systems

AU - Ter Beek, Maurice H.

AU - Csuhaj-Varjú, E.

AU - Holzer, Markus

AU - Vaszil, György

PY - 2004

Y1 - 2004

N2 - We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (≤k-, ≥k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.

AB - We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (≤k-, ≥k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.

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

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

M3 - Article

AN - SCOPUS:35048856978

VL - 3340

SP - 76

EP - 88

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -