On active symbols in CD grammar systems

Authors:
Henning Bordihn;Bettina Sunckel
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Johann Wolfgang Goethe- Universität, Frankfurt am Main, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 13
Cited 1

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
On the number of active nonterminals of cooperating/distributed grammar systems

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Grammar systems

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

Theoretical Computer Science
On the number of active symbols in L and CD grammar systems

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Mathematical Theory of L Systems

Mathematical Theory of L Systems
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
Sequential versus parallel grammar formalisms with respect to measures of descriptional complexity

Fundamenta Informaticae
On the number of components in cooperating distributed grammar systems

Theoretical Computer Science - Descriptional complexity of formal systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Active Symbols in Pure Systems

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On Metalinear CD Grammar Systems

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS

Descriptional complexity of restricted CD grammar systems

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the number of active symbols for cooperating distributed grammar systems having context-free or meta-linear components, both admitting and not admitting erasing productions. We show that the number of active symbols can be restricted to be constant for all modes of derivation under consideration, in most cases even to 1 or 2.