On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions

Authors:
Jürgen Dassow
Affiliations:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 Magdeburg, Germany. E-mail: dassow@iws.cs.uni-magdeburg.de
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Year:
2007

Citing 9
Cited 1

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
Grammars with controlled derivations

Handbook of formal languages, vol. 2
Grammar systems

Handbook of formal languages, vol. 2
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization

Theoretical Computer Science
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
Mathematical Theory of L Systems

Mathematical Theory of L Systems
On competence in CD grammar systems

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

Left Random Context ET0L Grammars

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define cooperating distributed grammar systems with start and stop conditions which are based on the competence of a component on the current sentential form. We distinguish six different types of competence conditions which result in 18 types of grammar systems. We summarize the results on the generative power known from the literature (where they are sometimes not related to competence) and determine the power of some further grammar systems.