On the size complexity of hybrid networks of evolutionary processors

DOI10.1016/J.TCS.2004.07.035zbMath1078.68009OpenAlexW2088102138MaRDI QIDQ1763710

Juan Castellanos, Peter Leupold, Victor Mitrana

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.035

zbMATH Keywords

ConnectivityEvolutionary operationsEvolutionary processorHybrid network of evolutionary processorsSize complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Related Items (7)

On the recognition of context-free languages using accepting hybrid networks of evolutionary processors ⋮ On the number of nodes in universal networks of evolutionary processors ⋮ Accepting networks of splicing processors: complexity results ⋮ Biocomputing: an insight from linguistics ⋮ A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors ⋮ On the size of computationally complete hybrid networks of evolutionary processors ⋮ On the size complexity of universal accepting hybrid networks of evolutionary processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular component splittable languages
• Networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• On the Computational Complexity of Algorithms
• DNA Computing
• A helpful result for proving inherent ambiguity
• Aspects of Molecular Computing

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