On the size complexity of hybrid networks of evolutionary processors

DOI10.1016/j.tcs.2004.07.035zbMath1078.68009MaRDI 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

Connectivity; Evolutionary operations; Evolutionary processor; Hybrid network of evolutionary processors; Size complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68M14: Distributed systems

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item