Computational completeness of simple semi-conditional insertion-deletion systems

DOI10.1007/978-3-319-92435-9_7zbMath1410.68187OpenAlexW2807324802MaRDI QIDQ1799363

Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-92435-9_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

Parsimonious computational completeness ⋮ On the generative capacity of matrix insertion-deletion systems of small sum-norm ⋮ Single semi-contextual insertion-deletion systems ⋮ Unnamed Item ⋮ Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)

This page was built for publication: Computational completeness of simple semi-conditional insertion-deletion systems