scientific article
From MaRDI portal
Publication:3517098
DOI10.25596/jalc-2007-117zbMath1149.68042MaRDI QIDQ3517098
Rudolf Freund, Henning Fernau, Marion Oswald, Klaus Reinhardt
Publication date: 12 August 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Parsimonious computational completeness ⋮ The power of programmed grammars with graphs from various classes ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Scattered context grammars generate any recursively enumerable language with two nonterminals ⋮ Nonterminal complexity of one-sided random context grammars ⋮ Workspace theorems for regular-controlled grammars ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Simple restriction in context-free rewriting ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ Nonterminal complexity of tree controlled grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion ⋮ Generalized forbidding matrix grammars and their membrane computing perspective ⋮ Reachability in Petri Nets with Inhibitor Arcs ⋮ Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings ⋮ On the computational completeness of matrix simple semi-conditional grammars
This page was built for publication:
