scientific article; zbMATH DE number 1342113
From MaRDI portal
Publication:4263694
zbMath0946.68084MaRDI QIDQ4263694
Lila Kari, Gabriel Thierrin, Gheorghe Păun, Sheng Yu
Publication date: 17 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Turing machines and related notions (03D10)
Related Items (14)
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Adding matrix control: insertion-deletion systems with substitutions. III ⋮ Parsimonious computational completeness ⋮ Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States ⋮ Single semi-contextual insertion-deletion systems ⋮ Unnamed Item ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ When Stars Control a Grammar's Work ⋮ On path-controlled insertion-deletion systems ⋮ Further Results on Insertion-Deletion Systems with One-Sided Contexts ⋮ Universal insertion grammars of size two ⋮ On bonded sequential and parallel insertion systems ⋮ On the overlap assembly of strings and languages ⋮ Using DNA to solve the bounded Post correspondence problem
This page was built for publication:
