A study in parallel rewriting systems

DOI10.1016/S0019-9958(80)90066-2zbMath0436.68051OpenAlexW1999829013MaRDI QIDQ3877058

Grzegorz Rozenberg, H. C. M. Kleijn

Publication date: 1980

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(80)90066-2

zbMATH Keywords

L systemsETOL languageparallel rewriting systemsIndian parallel grammarsRussian parallel grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

Active symbols in grammars with valuations ⋮ Languages of colonies ⋮ Restriction of active symbols in k-limited etol systems and a normal form theorem ⋮ On the Kleijn-Rozenberg k-adjacent languages ⋮ On the number of active states in deterministic and nondeterministic finite automata ⋮ Comparison of basic language generating devices (non-deterministic systems) ⋮ Extended spiking neural P systems with white hole rules and their red-green variants ⋮ Teams in cooperating grammar systems ⋮ A three-restricted normal form theorem for ETOL languages ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS ⋮ On the number of active states in finite automata ⋮ ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS ⋮ Unnamed Item ⋮ Decidability of EDT0L structural equivalence

This page was built for publication: A study in parallel rewriting systems