Minimal Parallelism for Polarizationless P Systems

DOI10.1007/11925903_2MaRDI QIDQ5452558zbMATH OpenOpenAlexFDO

Authors Tseren-Onolt Ishdorj

Publication date 4 April 2008

Published in DNA Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11925903_2

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5290042
• Minimal parallelism and number of membrane polarizations
• Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
• P systems with minimal parallelism
• Complexity aspects of polarizationless membrane systems

Cited in

(8)

• Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons
• Flat maximal parallelism in P systems with promoters
• scientific article; zbMATH DE number 5290042 (Why is no real title available?)
• Computing with cells: membrane systems – some complexity issues
• Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
• A framework for complexity classes in membrane computing
• Minimization strategies for maximally parallel multiset rewriting systems
• P systems with minimal parallelism

This page was built for publication: Minimal Parallelism for Polarizationless P Systems

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