Accepting Networks of Splicing Processors with Filtered Connections

DOI10.1007/978-3-540-74593-8_19MaRDI QIDQ3608485zbMATH OpenOpenAlexFDO

Authors Juan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana

Publication date 5 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74593-8_19

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• New Computational Paradigms
• Accepting networks of splicing processors: complexity results
• On small, reduced, and fast universal accepting networks of splicing processors
• On Accepting Networks of Splicing Processors of Size 3
• Generating networks of splicing processors
• Networks of splicing processors: simulations between topologies
• Networks of Polarized Splicing Processors
• Accepting networks of evolutionary processors with filtered connections
• Networks of splicing processors with evaluation sets as optimization problems solvers
• Small networks of polarized splicing processors are universal

Cited in

(7)

• Accepting networks of evolutionary processors with filtered connections
• New Computational Paradigms
• Accepting networks of splicing processors: complexity results
• Networks of Polarized Splicing Processors
• On Accepting Networks of Splicing Processors of Size 3
• On small, reduced, and fast universal accepting networks of splicing processors
• Small networks of polarized splicing processors are universal

This page was built for publication: Accepting Networks of Splicing Processors with Filtered Connections

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