Networks of Polarized Splicing Processors

DOI10.1007/978-3-319-71069-3_13MaRDI QIDQ5055983zbMATH OpenOpenAlexFDO

Authors Victor Mitrana, Andrei Păun, Mihaela Păun, Henning Bordihn

Publication date 9 December 2022

Published in Theory and Practice of Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-71069-3_13

zbMATH Keywords

computing with DNApolarizationsplicingsplicing processor

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Recommendations

• Networks of polarized evolutionary processors are computationally complete
• On Accepting Networks of Splicing Processors of Size 3
• On the computational power of networks of polarized evolutionary processors
• Accepting Networks of Splicing Processors with Filtered Connections
• On small, reduced, and fast universal accepting networks of splicing processors

Cites work

• Accepting networks of splicing processors: complexity results
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• scientific article; zbMATH DE number 992003 (Why is no real title available?)
• scientific article; zbMATH DE number 1189119 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1343486 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1086502 (Why is no real title available?)
• scientific article; zbMATH DE number 1860699 (Why is no real title available?)
• scientific article; zbMATH DE number 2089984 (Why is no real title available?)
• scientific article; zbMATH DE number 907955 (Why is no real title available?)
• On small, reduced, and fast universal accepting networks of splicing processors
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES

Cited in

(13)

• On small, reduced, and fast universal accepting networks of splicing processors
• Networks of splicing processors with evaluation sets as optimization problems solvers
• Polarization: a new communication protocol in networks of bio-inspired processors
• Accepting Networks of Splicing Processors with Filtered Connections
• Generating networks of splicing processors
• On the computational power of networks of polarized evolutionary processors
• scientific article; zbMATH DE number 5692234 (Why is no real title available?)
• Networks of polarized evolutionary processors are computationally complete
• On Accepting Networks of Splicing Processors of Size 3
• New Computational Paradigms
• Networks of splicing processors: simulations between topologies
• Small networks of polarized splicing processors are universal
• Networks of polarized multiset processors

This page was built for publication: Networks of Polarized Splicing Processors

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