A note on programmed 0L systems
In this note we prove that the family of programmed 0L languages coincides with the family of context free programmed languages. This solves a problem posed by \textit{K. S. Rajasethupathy} and \textit{R. K. Shyamasundar} [ibid. 20, 137-150 (1980; Zbl 0452.68077)].
scientific article; zbMATH DE number 3967932