Universality and computational completeness of controlled leftist insertion-deletion systems
From MaRDI portal
Recommendations
- Universality of graph-controlled leftist insertion-deletion systems with two states
- Graph-controlled insertion-deletion systems
- Further Results on Insertion-Deletion Systems with One-Sided Contexts
- Random context and semi-conditional insertion-deletion systems
- Insertion-Deletion Systems with One-Sided Contexts
Cited in
(13)- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Universality of graph-controlled leftist insertion-deletion systems with two states
- 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
- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
- When Stars Control a Grammar's Work
- Contextual insertions/deletions and computability
- 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
This page was built for publication: Universality and computational completeness of controlled leftist insertion-deletion systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601152)
