Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors

DOI10.1142/S0129054119400264zbMath1427.68078OpenAlexW2974767025WikidataQ127226648 ScholiaQ127226648MaRDI QIDQ5205040

Sergey Verlan, Rudolf Freund, Vladimir Rogozhin

Publication date: 10 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054119400264

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (3)

Rule synchronization for monodirectional tissue-like P systems with channel states ⋮ Rule synchronization for tissue P systems ⋮ A survey on computationally complete accepting and generating networks of evolutionary processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating and accepting P systems with minimal left and right insertion and deletion
• On the computational power of networks of polarized evolutionary processors
• On the number of nodes in universal networks of evolutionary processors
• Networks of evolutionary processors
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
• Networks of evolutionary processors: the power of subregular filters
• On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters
• Circular Post Machines and P Systems with Exo-insertion and Deletion
• Networks of Polarized Evolutionary Processors Are Computationally Complete
• Formal Reductions of the General Combinatorial Decision Problem

This page was built for publication: Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors