Acta Informatica
k-limited OL systems and languages
Journal of Information Processing and Cybernetics
A remark on limited OL systems
Journal of Information Processing and Cybernetics
On the degree of synchronization of klTOL and k1ETOL systems
Information Processing Letters
On k-uniformly-limited TOL systems and languages
Journal of Information Processing and Cybernetics
Petri net algorithms in the theory of matrix grammars
Acta Informatica
Grammars, grammar systems, and GSM mappings with valences
Mathematical aspects of natural and formal languages
Journal of Automata, Languages and Combinatorics
Remarks on regulated limited ET0L systems and regulated context-free grammars
Theoretical Computer Science
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
Theoretical Computer Science
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Sequential grammars and automata with valances
Theoretical Computer Science
| Hi-index | 0.00 |
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 quasiintersection, valence gsm mappings and intersection with regular valence languages. Moreover, we solve a question marked as open in [36] by proving that the uniformly k-limited ET0L languages form a full semi-AFL for all k≥1.