We investigate four variants of valence regulations incorporated in (limited) Lindenmayer systems, focussing on hierarchical relations and closure properties. Strong connections to well-known families of languages obtained by regulated rewriting are established. We prove several new results on valence transducers and valence generalized sequential machines (gsm). In this way, we can show new properties of ET0L languages, namely the non-closure under permutation, quasiintersection, valence gsm mappings and intersection with regular valence languages. Moreover, we solve a question marked as open in  by proving that the uniformly k-limited ET0L languages form a full semi-AFL for all k 1
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.