Generating networks of splicing processors

DOI10.1051/ITA/2012016MaRDI QIDQ4649456zbMATH OpenOpenAlexFDO

Authors Florin Manea, Bianca Truthe, Jürgen Dassow

Publication date 22 November 2012

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/cadaa750744e293e7295c6bb740827c6ab6c3463

zbMATH Keywords

computational completenessnetworks of splicing processorsnetworks of splicing processors with filterssplicing

Mathematics Subject Classification ID

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

Recommendations

• Networks of evolutionary processors: computationally complete normal forms
• On Accepting Networks of Splicing Processors of Size 3
• Networks of Polarized Splicing Processors
• On the Power of Networks of Evolutionary Processors
• Accepting networks of evolutionary word and picture processors: a survey

Cited in

(6)

• Computing by splicing
• Accepting Networks of Splicing Processors with Filtered Connections
• scientific article; zbMATH DE number 1286204 (Why is no real title available?)
• New Computational Paradigms
• Networks of splicing processors: simulations between topologies
• Small networks of polarized splicing processors are universal

This page was built for publication: Generating networks of splicing processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649456)