Time-freeness and clock-freeness and related concepts in P systems
From MaRDI portal
Publication:2285665
DOI10.1016/J.TCS.2018.09.009zbMATH Open1436.68109OpenAlexW2786988550MaRDI QIDQ2285665FDOQ2285665
Bosheng Song, Sergiu Ivanov, Linqiang Pan, Rudolf Freund, Artiom Alhazov
Publication date: 8 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.009
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- An efficient time-free solution to SAT problem by P systems with proteins on membranes
- Membrane Computing
- Functional reactive animation
- A Formal Framework for Static (Tissue) P Systems
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- Membrane Computing
- P Systems Working in Maximal Variants of the Set Derivation Mode
- A formal framework for clock-free networks of cells
- A General Framework for Regulated Rewriting Based on the Applicability of Rules
- Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN
Cited In (1)
Uses Software
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)