On the size of components of probabilistic cooperating distributed grammar systems

E. Csuhaj-Varjú, Jürgen Dassow

Research output: Contribution to journalArticle

Abstract

Probabilistic cooperating distributed grammar systems introduced in [1] are systems of probabilistic grammars in the sense of [9], i.e., a probability is associated with any transition from one rule to another rule and with any transition from one probabilistic grammar to another probabilistic grammar; a probabilistic grammar stops, if the chosen rule cannot be applied; and the generated language contains only words where the product of the transitions is larger than a certain cut-point). We study the families obtained with cut-point 0 by restricting the number of rules in a probabilistic component. We show that at most two productions in any component are sufficient to generate any recursively enumerable language. If one restricts to probabilistic components with one production in any component, then one obtains the family of deterministic ET0L systems.

Original languageEnglish
Pages (from-to)49-59
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3113
Publication statusPublished - 2004

Fingerprint

Computer Communication Networks
Grammar
Language
Recursively Enumerable Languages
Sufficient

ASJC Scopus subject areas

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

Cite this

@article{f7b07652ff7a4579bac0ee8bce05c5c0,
title = "On the size of components of probabilistic cooperating distributed grammar systems",
abstract = "Probabilistic cooperating distributed grammar systems introduced in [1] are systems of probabilistic grammars in the sense of [9], i.e., a probability is associated with any transition from one rule to another rule and with any transition from one probabilistic grammar to another probabilistic grammar; a probabilistic grammar stops, if the chosen rule cannot be applied; and the generated language contains only words where the product of the transitions is larger than a certain cut-point). We study the families obtained with cut-point 0 by restricting the number of rules in a probabilistic component. We show that at most two productions in any component are sufficient to generate any recursively enumerable language. If one restricts to probabilistic components with one production in any component, then one obtains the family of deterministic ET0L systems.",
author = "E. Csuhaj-Varj{\'u} and J{\"u}rgen Dassow",
year = "2004",
language = "English",
volume = "3113",
pages = "49--59",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - On the size of components of probabilistic cooperating distributed grammar systems

AU - Csuhaj-Varjú, E.

AU - Dassow, Jürgen

PY - 2004

Y1 - 2004

N2 - Probabilistic cooperating distributed grammar systems introduced in [1] are systems of probabilistic grammars in the sense of [9], i.e., a probability is associated with any transition from one rule to another rule and with any transition from one probabilistic grammar to another probabilistic grammar; a probabilistic grammar stops, if the chosen rule cannot be applied; and the generated language contains only words where the product of the transitions is larger than a certain cut-point). We study the families obtained with cut-point 0 by restricting the number of rules in a probabilistic component. We show that at most two productions in any component are sufficient to generate any recursively enumerable language. If one restricts to probabilistic components with one production in any component, then one obtains the family of deterministic ET0L systems.

AB - Probabilistic cooperating distributed grammar systems introduced in [1] are systems of probabilistic grammars in the sense of [9], i.e., a probability is associated with any transition from one rule to another rule and with any transition from one probabilistic grammar to another probabilistic grammar; a probabilistic grammar stops, if the chosen rule cannot be applied; and the generated language contains only words where the product of the transitions is larger than a certain cut-point). We study the families obtained with cut-point 0 by restricting the number of rules in a probabilistic component. We show that at most two productions in any component are sufficient to generate any recursively enumerable language. If one restricts to probabilistic components with one production in any component, then one obtains the family of deterministic ET0L systems.

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

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

M3 - Article

AN - SCOPUS:35048896041

VL - 3113

SP - 49

EP - 59

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -