A note on programmed 0L systems

DOI10.1016/0020-0255(83)90041-5MaRDI QIDQ1080664zbMATH OpenOpenAlexFDO

Authors Jürgen Dassow

Publication date 1983

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(83)90041-5

zbMATH Keywords

context free programmed languagesprogrammed 0L languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Review text

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)].

Recommendations

• scientific article; zbMATH DE number 4080939
• Function-limited 0L systems revisited
• scientific article; zbMATH DE number 4043272
• scientific article; zbMATH DE number 4080938
• On the union of 0L languages

Cites work

• scientific article; zbMATH DE number 3688752 (Why is no real title available?)
• scientific article; zbMATH DE number 3483596 (Why is no real title available?)
• scientific article; zbMATH DE number 3540384 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Parallel OL-languages
• Programmed OL-systems

Cited in

(2)

• Regulation ofK-limited etol systems
• On regularly controlled a limited tol systems

This page was built for publication: A note on programmed 0L systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080664)