A study in parallel rewriting systems
From MaRDI portal
Publication:3877058
DOI10.1016/S0019-9958(80)90066-2zbMath0436.68051MaRDI 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
L systems; ETOL language; parallel rewriting systems; Indian parallel grammars; Russian parallel grammars
68Q45: Formal languages and automata
Related Items
Teams in cooperating grammar systems, Unnamed Item, Comparison of some descriptional complexities of 0L systems obtained by a unifying approach, A three-restricted normal form theorem for ETOL languages, Languages of colonies, On the Kleijn-Rozenberg k-adjacent languages, Decidability of EDT0L structural equivalence, On the number of active states in finite automata, Active symbols in grammars with valuations, On the number of active states in deterministic and nondeterministic finite automata, ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS, ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS, Comparison of basic language generating devices (non-deterministic systems), Restriction of active symbols in k-limited etol systems and a normal form theorem