Universal matrix insertion grammars with small size

DOI10.1007/978-3-319-58187-3_14zbMath1486.68086OpenAlexW2609018085MaRDI QIDQ2400963

Henning Fernau, Lakshmanan Kuppusamy, Sergey Verlan

Publication date: 31 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58187-3_14

zbMATH Keywords

homomorphismrecursively enumerable setsinsertion grammarsmatrix insertion grammarsregular intersection and quotient

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Recursively (computably) enumerable sets and degrees (03D25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (10)

Parsimonious computational completeness ⋮ On the generative capacity of matrix insertion-deletion systems of small sum-norm ⋮ Single semi-contextual insertion-deletion systems ⋮ Unnamed Item ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ Unnamed Item ⋮ Modeling of RNA secondary structures using two-way quantum finite automata ⋮ Decidability Questions for Insertion Systems and Related Models ⋮ Universal insertion grammars of size two ⋮ Prescribed teams of rules working on several objects

This page was built for publication: Universal matrix insertion grammars with small size