Some New Modes of Competence-Based Derivations in CD Grammar Systems

Authors:
Erzsébet Csuhaj-Varjú;Jürgen Dassow;György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary H-1111;Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany D-39016;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary H-1111
Venue:
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Year:
2008

Citing 8
Cited 2

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
On competence and completeness in CD grammar systems

Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Grammar systems

Handbook of formal languages, vol. 2
Handbook of Formal Languages

Handbook of Formal Languages
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On competence in CD grammar systems

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

CD grammar systems: competence and confidence

Computation, cooperation, and life
Left Random Context ET0L Grammars

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce some new cooperation protocols for cooperating distributed (CD) grammar systems. They depend on the number of different nonterminals present in the sentential form if a component has finished its work, i.e. on the final competence or efficiency of the grammar on the string (the competence is large if the number of the different nonterminals is small). 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 kstep limited derivations (for k茂戮驴 3) as underlying derivations, they are able to generate any recursively enumerable language.