On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes

DOI10.1007/978-3-642-00982-2_50zbMath1234.68229OpenAlexW1506533502MaRDI QIDQ3618615

Bianca Truthe, Victor Mitrana

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_50

Mathematics Subject Classification ID

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

Related Items (2)

Simulating polarization by random context filters in networks of evolutionary processors ⋮ Accepting networks of genetic processors are computationally complete

Cites Work

• Unnamed Item
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• On Networks of Evolutionary Processors with Nodes of Two Types
• Accepting Networks of Non-inserting Evolutionary Processors
• DNA Computing

This page was built for publication: On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes