On the ambiguity of insertion systems

DOI10.1142/S0129054111009008zbMATH Open1252.68117OpenAlexW2171337548MaRDI QIDQ2909109FDOQ2909109

Authors: Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan 

Publication date: 29 August 2012

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

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

Recommendations

• On the computational power of insertion-deletion systems
• scientific article; zbMATH DE number 1953225
• Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
• Recent developments on insertion-deletion systems
• scientific article; zbMATH DE number 1342113

zbMATH Keywords

undecidabilityinsertion systemsinherently ambiguous languagesunambiguous system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Insertion languages
• Title not available (Why is that?)
• Contextual insertions/deletions and computability

Cited In (4)

• Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
• On the computational power of insertion-deletion systems
• Ambiguity in insertion-deletion kolam array grammars
• On bonded sequential and parallel insertion systems

This page was built for publication: On the ambiguity of insertion systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909109)