Sequential versus parallel grammar formalisms with respect to measures of descriptional complexity

Authors:
Suna Aydin;Henning Bordihn
Affiliations:
Universität Potsdam, Institut für Informatik, August-Bebel-Straße 89, 14482 Potsdam, Germany;Universität Potsdam, Institut für Informatik, August-Bebel-Straße 89, 14482 Potsdam, Germany
Venue:
Fundamenta Informaticae
Year:
2002

Citing 5
Cited 1

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
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 Size of Components of Cooperating Grammar Systems

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
On descriptions of context-free languages by CD grammar systems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures

On active symbols in CD grammar systems

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so-called t-mode of derivation) are treated with respect to these complexity measures. In the pure case, where no distinction between terminal and nonterminal symbols is made, the sequential mechanisms are compared with the parallel ones, investigating whether one mechanism may have a better descriptional complexity than the other one when the same language is described.