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

DOI10.1017/S0960129507006202zbMath1125.68053MaRDI QIDQ5756979

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

Publication date: 6 September 2007

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

Mathematics Subject Classification ID

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

Related Items (18)

Simulating polarization by random context filters in networks of evolutionary processors ⋮ All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size ⋮ Universality in Molecular and Cellular Computing ⋮ Networks of polarized evolutionary processors ⋮ ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS ⋮ On the computational power of networks of polarized evolutionary processors ⋮ Filters defined by random contexts versus polarization in networks of evolutionary processors ⋮ Accepting networks of evolutionary processors with subregular filters ⋮ Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors ⋮ Complexity-preserving simulations among three variants of accepting networks of evolutionary processors ⋮ Small universal accepting hybrid networks of evolutionary processors ⋮ On the size of computationally complete hybrid networks of evolutionary processors ⋮ Complexity results for deciding networks of evolutionary processors ⋮ Networks of splicing processors with evaluation sets as optimization problems solvers ⋮ On small, reduced, and fast universal accepting networks of splicing processors ⋮ Polarization: a new communication protocol in networks of bio-inspired processors ⋮ A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors ⋮ Accepting Networks of Non-inserting Evolutionary Processors

Cites Work

• On the size complexity of hybrid networks of evolutionary processors

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