Accepting Networks of Non-inserting Evolutionary Processors

DOI10.1007/978-3-642-04186-0_9zbMath1230.68127OpenAlexW1883385000MaRDI QIDQ3642956

Victor Mitrana, Juergen Dassow

Publication date: 10 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04186-0_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Universality in Molecular and Cellular Computing ⋮ The role of evolutionary operations in accepting hybrid networks of evolutionary processors ⋮ On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes ⋮ Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application ⋮ A survey on computationally complete accepting and generating networks of evolutionary processors ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters

Cites Work

• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Computing with membranes
• Hybrid networks of evolutionary processors are computationally complete
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• On the Power of Networks of Evolutionary Processors
• DNA Computing
• On the size complexity of universal accepting hybrid networks of evolutionary processors

This page was built for publication: Accepting Networks of Non-inserting Evolutionary Processors