Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0129054110007428 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Field | DocType | Volume |
Attribute grammar,Discrete mathematics,Combinatorics,Grammar-based code,Recursively enumerable language,Operator-precedence grammar,Grammar,Formal grammar,Unrestricted grammar,Mathematics | Journal | 21 |
Issue | ISSN | Citations |
4 | 0129-0541 | 1 |
PageRank | References | Authors |
0.35 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erzsébet Csuhaj-Varjú | 1 | 593 | 87.27 |
| Jürgen Dassow | 2 | 530 | 118.27 |
| György Vaszil | 3 | 277 | 40.65 |