Graph-controlled insertion-deletion systems
From MaRDI portal
Publication:4964013
Recommendations
- On path-controlled insertion-deletion systems
- Descriptional complexity of graph-controlled insertion-deletion systems
- Computational completeness of path-structured graph-controlled insertion-deletion systems
- Matrix insertion-deletion systems
- P systems with minimal left and right insertion and deletion
Cited in
(29)- On path-controlled insertion-deletion systems
- Universal insertion grammars of size two
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Computational completeness of path-structured graph-controlled insertion-deletion systems
- Generating and accepting P systems with minimal left and right insertion and deletion
- Descriptional complexity of graph-controlled insertion-deletion systems
- Universality of graph-controlled leftist insertion-deletion systems with two states
- Small size insertion and deletion systems
- scientific article; zbMATH DE number 4090811 (Why is no real title available?)
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
- Universality and computational completeness of controlled leftist insertion-deletion systems
- On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
- P systems with minimal left and right insertion and deletion
- (Tissue) P systems with vesicles of multisets
- Decidability questions for insertion systems and related models
- Regulated insertion-deletion systems
- Investigations on the power of matrix insertion-deletion systems with small sizes
- On the generative capacity of matrix insertion-deletion systems of small sum-norm
- Single semi-contextual insertion-deletion systems
- Tissue P Systems with Vesicles of Multisets
- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
- When Stars Control a Grammar's Work
- Space separating special Geffert normal form for succinct representation of star-controlled insertion-deletion systems
- Star-controlled insertion-deletion systems describing regular closure of linear languages
- Succinct star-controlled insertion-deletion systems using space separating normal forms
- Matrix insertion-deletion systems
- On time-varying insertion-deletion systems
- Parsimonious computational completeness
This page was built for publication: Graph-controlled insertion-deletion systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964013)