On the size complexity of universal accepting hybrid networks of evolutionary processors

DOI10.1017/S0960129507006202zbMATH Open1125.68053MaRDI QIDQ5756979FDOQ5756979

Authors: Florin Manea, Carlos Martín-Vide, Victor Mitrana 

Publication date: 6 September 2007

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Small universal accepting hybrid networks of evolutionary processors
• A universal accepting hybrid network of evolutionary processors
• About Universal Hybrid Networks of Evolutionary Processors of Small Size
• Accepting hybrid networks of evolutionary processors with special topologies and small communication
• DNA Computing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• On the size complexity of hybrid networks of evolutionary processors

Cited In (27)

• On the recognition of context-free languages using accepting hybrid networks of evolutionary processors
• Small universal accepting hybrid networks of evolutionary processors
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Complexity results for deciding networks of evolutionary processors
• Accepting networks of evolutionary processors with subregular filters
• Polarization: a new communication protocol in networks of bio-inspired processors
• Filters defined by random contexts versus polarization in networks of evolutionary processors
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
• Simulating polarization by random context filters in networks of evolutionary processors
• The role of evolutionary operations in accepting hybrid networks of evolutionary processors
• A linear time solution for \(N\)-queens problem using generalized networks of evolutionary polarized processors
• Accepting hybrid networks of evolutionary processors with special topologies and small communication
• On small, reduced, and fast universal accepting networks of splicing processors
• A survey on computationally complete accepting and generating networks of evolutionary processors
• Networks of polarized evolutionary processors
• On the size complexity of hybrid networks of evolutionary processors
• On the size of computationally complete hybrid networks of evolutionary processors
• Small universal accepting networks of evolutionary processors with filtered connections
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• Networks of splicing processors with evaluation sets as optimization problems solvers
• Universality in Molecular and Cellular Computing
• About Universal Hybrid Networks of Evolutionary Processors of Small Size
• ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS
• A universal accepting hybrid network of evolutionary processors
• Accepting Networks of Non-inserting Evolutionary Processors
• On the computational power of networks of polarized evolutionary processors
• Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

This page was built for publication: On the size complexity of universal accepting hybrid networks of evolutionary processors

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