On path-controlled insertion-deletion systems

DOI10.1007/S00236-018-0312-2MaRDI QIDQ1713412zbMATH OpenOpenAlexFDO

Authors Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

Publication date 25 January 2019

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-018-0312-2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Graph-controlled insertion-deletion systems
• Computational completeness of path-structured graph-controlled insertion-deletion systems
• On the computational power of insertion-deletion systems
• scientific article; zbMATH DE number 1953225
• scientific article; zbMATH DE number 2087035
• Descriptional complexity of graph-controlled insertion-deletion systems
• Recent developments on insertion-deletion systems
• Restricted insertion-deletion systems
• Insertion-Deletion Systems with One-Sided Contexts
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes

Cites work

• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1342113 (Why is no real title available?)
• scientific article; zbMATH DE number 2087035 (Why is no real title available?)
• scientific article; zbMATH DE number 3307580 (Why is no real title available?)
• About one-sided one-symbol insertion-deletion P systems
• An essay on general grammars
• Computational completeness of path-structured graph-controlled insertion-deletion systems
• Computational power of insertion-deletion (P) systems with rules of size two
• Context-free insertion-deletion systems
• Contextual insertions/deletions and computability
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Graph-controlled insertion-deletion systems
• Graph-controlled insertion-deletion systems generating language classes beyond linearity
• Insertion languages
• Insertion-Deletion Systems with One-Sided Contexts
• Length P systems
• Marcus contextual grammars
• Matrix insertion-deletion systems
• Membrane computing. An introduction.
• Normal forms for phrase-structure grammars
• On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
• On the computational power of insertion-deletion systems
• P systems with minimal insertion and deletion
• Parikh images of matrix ins-del systems
• Random context and semi-conditional insertion-deletion systems
• Recent developments on insertion-deletion systems
• Regulated RNA rewriting: Modelling RNA editing with guided insertion

Cited in

(13)

• Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
• Parsimonious computational completeness
• Computational completeness of path-structured graph-controlled insertion-deletion systems
• When Stars Control a Grammar's Work
• Generalized forbidding matrix grammars and their membrane computing perspective
• On Szilard languages of InsDel systems
• scientific article; zbMATH DE number 1953225 (Why is no real title available?)
• Recent developments on insertion-deletion systems
• On bonded sequential and parallel insertion systems
• Descriptional complexity of graph-controlled insertion-deletion systems
• Graph-controlled insertion-deletion systems
• Universality of graph-controlled leftist insertion-deletion systems with two states

This page was built for publication: On path-controlled insertion-deletion systems

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