On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems

DOI10.1142/S0129054116500295zbMath1358.68171OpenAlexW2581920995MaRDI QIDQ2970200

Kamala Krithivasan, Indhumathi Raman, Lakshmanan Kuppusamy

Publication date: 28 March 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054116500295

zbMATH Keywords

context-free languagesinsertion-deletion systemsdescriptional complexity measures

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion

Cites Work

• P systems with minimal insertion and deletion
• Contextual insertions/deletions and computability
• Matrix insertion-deletion systems
• Insertion languages
• On the computational power of insertion-deletion systems
• On strongly context-free languages

This page was built for publication: On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems