Time-freeness and clock-freeness and related concepts in P systems
From MaRDI portal
Publication:2285665
Recommendations
Cites work
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A Formal Framework for Static (Tissue) P Systems
- A formal framework for clock-free networks of cells
- A general framework for regulated rewriting based on the applicability of rules
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- An efficient time-free solution to SAT problem by P systems with proteins on membranes
- Asynchronous and maximally parallel deterministic controlled non-cooperative P systems characterize NFIN and coNFIN
- Functional reactive animation
- Membrane Computing
- Membrane Computing
- P systems working in maximal variants of the set derivation mode
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Time-free solution to SAT problem using P systems with active membranes
Cited in
(8)
This page was built for publication: Time-freeness and clock-freeness and related concepts in P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285665)