Star-controlled insertion-deletion systems describing regular closure of linear languages
From MaRDI portal
Cites work
- A characterization of context-free languages
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
- 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
- Generalized forbidding matrix grammars and their membrane computing perspective
- Graph-controlled insertion-deletion systems
- scientific article; zbMATH DE number 1738663 (Why is no real title available?)
- scientific article; zbMATH DE number 2087035 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
- Improved descriptional complexity results on generalized forbidding grammars
- Improved descriptional complexity results on generalized forbidding grammars
- Insertion-Deletion Systems with One-Sided Contexts
- Matrix insertion-deletion systems
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
- New nonterminal complexity results for semi-conditional grammars
- Normal forms for phrase-structure grammars
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
- On matrix ins-del systems of small sum-norm
- On path-controlled insertion-deletion systems
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- On the computational completeness of matrix simple semi-conditional grammars
- On the computational power of insertion-deletion systems
- On the generative capacity of matrix insertion-deletion systems of small sum-norm
- P systems with minimal insertion and deletion
- Parsimonious computational completeness
- Properties of language classes between linear and context-free
- Random context and semi-conditional insertion-deletion systems
- Recent developments on insertion-deletion systems
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- Universality and computational completeness of controlled leftist insertion-deletion systems
- When Stars Control a Grammar's Work
This page was built for publication: Star-controlled insertion-deletion systems describing regular closure of linear languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907606)
