A note on cooperating distributed grammar systems working in combined modes

Authors:
Henning Bordihn;Markus Holzer
Affiliations:
Institut für Informatik, Universität Giessen, Arndtstraße 2, D-35392 Giessen, Germany;Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching bei München, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 0

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
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
On the number of components in cooperating distributed grammar systems

Theoretical Computer Science - Descriptional complexity of formal systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

We investigate the generative power of cooperating distributed grammar systems with context-free rules working in the full-competence mode in combination with another derivation mode, combined sf-mode, for short. A combined sf-mode as, for example, (sf@?=