On the power of generalized forbidding insertion-deletion systems

DOI10.1007/978-3-030-62536-8_5MaRDI QIDQ2040409zbMATH OpenOpenAlexFDO

Authors Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

Publication date 14 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-62536-8_5

zbMATH Keywords

descriptional complexityforbidding grammarsinsertion-deletionsemi-conditionalspecial geffert normal form

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
• Context-free insertion-deletion systems
• Single semi-contextual insertion-deletion systems
• Insertion-deletion systems with substitutions. I
• Restricted insertion-deletion systems

Cited in

(6)

• Parsimonious computational completeness
• Single semi-contextual insertion-deletion systems
• Generalized forbidding matrix grammars and their membrane computing perspective
• On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
• scientific article; zbMATH DE number 1953225 (Why is no real title available?)
• scientific article; zbMATH DE number 7584595 (Why is no real title available?)

This page was built for publication: On the power of generalized forbidding insertion-deletion systems

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