On path-controlled insertion-deletion systems
type: Item
instance of: scholarly article
title: On path-controlled insertion-deletion systems
zbMATH Open document ID: 1410.68188
author: Henning Fernau
author: Lakshmanan Kuppusamy
author: Indhumathi Raman
published in: Acta Informatica
publication date: 2019-01-25T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 7006681
MaRDI profile type: Publication
full work available at URL: s00236-018-0312-2
OpenAlex ID: W2792842814
cites work: Length P Systems
cites work: P systems with minimal insertion and deletion
cites work: Regulated RNA rewriting: Modelling RNA editing with guided insertion
cites work: Q3178873
cites work: Parikh Images of Matrix Ins-Del Systems
cites work: Computational completeness of path-structured graph-controlled insertion-deletion systems
cites work: Graph-controlled insertion-deletion systems generating language classes beyond linearity
cites work: On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
cites work: On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
cites work: Q4964013
cites work: Normal forms for phrase-structure grammars
cites work: Insertion languages
cites work: About One-Sided One-Symbol Insertion-Deletion P Systems
cites work: Random context and semi-conditional insertion-deletion systems
cites work: Q4263694
cites work: Contextual insertions/deletions and computability
cites work: Further Results on Insertion-Deletion Systems with One-Sided Contexts
cites work: Computational power of insertion-deletion (P) systems with rules of size two
cites work: Q4737678
cites work: Q5588662
cites work: Context-free insertion-deletion systems
cites work: Insertion-Deletion Systems with One-Sided Contexts
cites work: Marcus contextual grammars
cites work: Membrane computing. An introduction.
cites work: Q4223673
cites work: Matrix insertion-deletion systems
cites work: On the computational power of insertion-deletion systems
cites work: Recent developments on insertion-deletion systems
DOI: 10.1007/S00236-018-0312-2
Recommended article: Q4964013
Recommended article: Computational completeness of path-structured graph-controlled insertion-deletion systems
Recommended article: On the computational power of insertion-deletion systems
Recommended article: Q4414687
Recommended article: Q4737678
Recommended article: Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
Recommended article: Recent developments on insertion-deletion systems
Recommended article: Q3428782
Recommended article: Insertion-Deletion Systems with One-Sided Contexts
Recommended article: On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
description: scientific article; zbMATH DE number 7006681