On the power of generalized forbidding insertion-deletion systems

DOI10.1007/978-3-030-62536-8_5OpenAlexW3102046050MaRDI QIDQ2040409FDOQ2040409

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)

Cited In (6)

• Parsimonious computational completeness
• Single semi-contextual insertion-deletion systems
• Generalized forbidding matrix grammars and their membrane computing perspective
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes

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)