## Regulated Grammars and Automata

- Alexander Meduna, Petr Zemek
- Springer New York
- 2014

@article{Bensch2003SequentialVP, title={Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity}, author={Suna Bensch and Henning Bordihn}, journal={Fundam. Inform.}, year={2003}, volume={55}, pages={243-254} }

- Published 2003 in Fundam. Inform.

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… CONTINUE READING