The degree of parallelism

Authors:
Hening Bordihn;Henning Fernau
Affiliations:
Universität Potsdam, Institut für Informatik, Potsdam, Germany;Fachbereich IV, Abteilung Informatik, Universität Trier, Trier, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 6
Cited 0

Pure languages and the degree of nondeterminism

Journal of Information Processing and Cybernetics
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)
Mathematical Theory of L Systems

Mathematical Theory of L Systems
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
D0L Systems With Rank

L Systems, Most of the papers were presented at a conference in Aarhus, Denmark
On the Height of Syntactical Graphs

Proceedings of the 5th GI-Conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the degree of parallelism is introduced and investigated. The degree of parallelism is a natural descriptional complexity measure of Lindenmayer and Bharat systems. This concept quantifies the amount of non-redundant parallelism needed in the derivations of those systems. We consider both static and dynamic versions of this notion. Corresponding hierarchy and undecidability results are established. Furthermore, we show that the degree of parallelism links to the notions of growth functions and active symbols.