Flat maximal parallelism in P systems with promoters

DOI10.1016/J.TCS.2015.10.027MaRDI QIDQ264535zbMATH OpenOpenAlexFDO

Authors Gheorghe Păun, Bosheng Song, Linqiang Pan

Publication date 31 March 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.10.027

zbMATH Keywords

membrane computingP systemparallelismuniversality

Mathematics Subject Classification ID

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

Recommendations

• Developments in Language Theory
• P systems with minimal parallelism
• Communication P systems with channel states working in flat maximally parallel manner
• Minimal Parallelism for Polarizationless P Systems
• scientific article; zbMATH DE number 5290042

Cites work

• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode
• A polynomial complexity class in P systems using membrane division
• Characterizing tractability by tissue-like P systems
• Computing with membranes
• FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS
• Fast hardware implementations of P systems
• Membrane computing. An introduction.
• ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
• P systems with minimal parallelism
• Promoters and inhibitors in purely catalytic P systems
• Unconventional Computation

Cited in

(22)

• Flattening the transition P systems with dissolution
• Cell-like P systems with evolutional symport/antiport rules and membrane creation
• Tissue-like P systems with evolutional symport/antiport rules
• The computational power of monodirectional tissue P systems with symport rules
• Flattening in (tissue) P systems
• Communication P systems with channel states working in flat maximally parallel manner
• Spiking neural P systems: main ideas and results
• The computational complexity of tissue P systems with evolutional symport/antiport rules
• Developments in Language Theory
• A formal framework for spiking neural P systems
• Spiking neural P systems with a flat maximally parallel use of rules
• Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division
• Spiking neural P systems with rules on synapses and anti-spikes
• Rule synchronization for monodirectional tissue-like P systems with channel states
• Solving the SAT problem by cell-like P systems with channel states and symport rules
• Monodirectional tissue P systems with channel states
• P systems working in maximal variants of the set derivation mode
• The computational power of enzymatic numerical P systems working in the sequential mode
• An efficient time-free solution to QSAT problem using P systems with proteins on membranes
• The computational power of tissue-like P systems with promoters
• Cell-like P systems with polarizations and minimal rules
• Rule synchronization for tissue P systems

This page was built for publication: Flat maximal parallelism in P systems with promoters

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