Publication:4886801
From MaRDI portal
zbMath0852.68051MaRDI QIDQ4886801
Lila Kari, Gheorghe Păun, Erzsébet Csuhaj-Varjú
Publication date: 23 July 1996
68Q42: Grammars and rewriting systems
Related Items
Unnamed Item, Networks of Polarized Splicing Processors, A Formal Framework for Static (Tissue) P Systems, Multiple splicing systems and the universal computability, Logical string rewriting, Small networks of polarized splicing processors are universal, Splicing systems with targets are computationally universal, Accepting networks of splicing processors: complexity results, On length-separating test tube systems, Accepting splicing systems, On small, reduced, and fast universal accepting networks of splicing processors, DNA computing based on splicing: Universality results, Nine test tubes generate any RE language, Cut, paste and filter., Topics in the theory of DNA computing., Networks of splicing processors with evaluation sets as optimization problems solvers, Polarization: a new communication protocol in networks of bio-inspired processors, Accepting splicing systems with permitting and forbidding words, A General Framework for Regulated Rewriting Based on the Applicability of Rules, Splicing Systems: Accepting Versus Generating, Universality in Molecular and Cellular Computing
