The conformon-P system: a molecular and cell biology-inspired computability model
From MaRDI portal
Publication:1884951
DOI10.1016/j.tcs.2003.09.008zbMath1070.68040OpenAlexW2082282155MaRDI QIDQ1884951
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.09.008
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)
Related Items
Parallel and Distributed Algorithms in P Systems, Three ``quantum algorithms to solve 3-SAT, Asynchronous P systems with active membranes, On the Qualitative Analysis of Conformon P Systems, Defining and Executing P Systems with Structured Data in K, P systems with control nuclei: the concept, Computing with energy and chemical reactions, Modeling the Dynamics of HIV Infection with Conformon-P Systems and Cellular Automata, (UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power, Conformon-P Systems with Negative Values, Characterizing the computational power of energy-based P systems, About \(P\) systems with symport/antiport
Cites Work
- The power of communication: P systems with symport/antiport
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Reversal-bounded multipushdown machines
- Remarks on blind and partially blind one-way multicounter machines
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Computing with membranes
- COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
- COMPUTING WITH MEMBRANES (P SYSTEMS): A VARIANT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
