Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
From MaRDI portal
Publication:2829975
DOI10.1007/978-3-319-41114-9_9zbMath1410.68184OpenAlexW2491357875MaRDI QIDQ2829975
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
Publication date: 9 November 2016
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01633956/file/416473_1_En_9_Chapter.pdf
computational completenessinsertion-deletion systemsdescriptional complexity measuresgraph-controlled systems
Related Items (3)
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational power of insertion-deletion (P) systems with rules of size two
- P systems with minimal insertion and deletion
- Recent developments on insertion-deletion systems
- Contextual insertions/deletions and computability
- Matrix insertion-deletion systems
- Insertion languages
- On the computational power of insertion-deletion systems
- Context-free insertion-deletion systems
- Finite turns and the regular closure of linear context-free languages
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States
- About One-Sided One-Symbol Insertion-Deletion P Systems
This page was built for publication: Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
