On the descriptional complexity of external hybrid cooperating distributed grammar systems

Authors:
Bettina Sunckel
Affiliations:
Institut für Informatik, Johann Wolfgang Goethe-Universität, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2006

Citing 6
Cited 0

Fairness in 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
On the Size of Components of Cooperating Grammar Systems

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate descriptional complexity aspects of external hybrid cooperating distributed (CD) grammar systems. An external hybrid CD grammar system consists of several grammars called components. The cooperation between the components is controlled by the derivation mode that determines when a component becomes active or inactive. We set our focus on the number of components and the maximum number of productions in a component. For some external hybrid CD grammar systems it is possible to find equivalent systems that consist of only five components. For these external hybrid CD grammar systems we can also construct equivalent systems with at most six productions in a component. If one of the two parameters is fixed, the other one induces an infinite hierarchy of language classes.