Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines
From MaRDI portal
Publication:4133165
DOI10.1016/S0019-9958(75)90066-2zbMath0357.68093MaRDI QIDQ4133165
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
Related Items
Cancellation in context-free languages: enrichment by reduction, \(\mathcal{L}\)-reduction computation revisited, On the power of cooperation: A regular representation of recursively enumerable languages, A note on a family of acceptors for some families of developmental languages†, On acceptors of iteration languages
