A note on the class of languages generated by F-systems over regular languages

DOI10.1016/J.IPL.2022.106283MaRDI QIDQ2094358zbMATH OpenOpenAlexFDO

Authors Sławomir Staworko, Jorge C. Lucero

Publication date 28 October 2022

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.15705

zbMATH Keywords

F-systemfoldingformal languageslinear languageregular language

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Pumping lemmas for classes of languages generated by folding systems
• On regularity of languages generated by copying systems
• scientific article; zbMATH DE number 1372648
• Theory and Applications of Models of Computation
• On the generative power of regular pattern grammars

Cites work

• Gene assembly in ciliates: Computing by folding and recombination
• Geometric folding algorithms. Linkages, origami, polyhedra
• scientific article; zbMATH DE number 1670714 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• On a family of linear grammars
• Pumping lemmas for linear and nonlinear context-free languages
• The Boolean closure of linear context-free languages

This page was built for publication: A note on the class of languages generated by F-systems over regular languages

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