String assembly in networks of evolutionary processors

DOI10.25596/JALC-2016-041MaRDI QIDQ3178871zbMATH OpenFDO

Authors Katalin Anna Lázár, Erzsébet Csuhaj-Varjú

Publication date 20 December 2016

Full work available at URL https://doi.org/10.25596/JALC-2016-041

zbMATH Keywords

computational completenessHamiltonian path problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2001369
• Developments in networks of evolutionary processors
• Network of evolutionary processors, past, present and future
• scientific article; zbMATH DE number 1728707
• On the size of computationally complete hybrid networks of evolutionary processors

Cited in

(4)

• Self-assembly of strings and languages
• Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules
• Unconventional computational models for distributed networks: results and perspectives
• Self-assembly of strings and languages revisited: efficiently deciding closure under self-assembly

This page was built for publication: String assembly in networks of evolutionary processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178871)