On the number of nodes in universal networks of evolutionary processors

DOI10.1007/S00236-006-0024-XzbMath1104.68092OpenAlexW2142138147MaRDI QIDQ854680

Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin

Publication date: 6 December 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0024-x

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

About Universal Hybrid Networks of Evolutionary Processors of Small Size ⋮ Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors ⋮ On the size of computationally complete hybrid networks of evolutionary processors ⋮ Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors ⋮ A survey on computationally complete accepting and generating networks of evolutionary processors

Cites Work

• Networks of evolutionary processors
• On the size complexity of hybrid networks of evolutionary processors
• Context-free insertion-deletion systems
• Hybrid networks of evolutionary processors are computationally complete
• DNA Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of nodes in universal networks of evolutionary processors