Pages that link to "Item:Q1763714"
From MaRDI portal
The following pages link to Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714):
Displaying 29 items.
- Small (purely) catalytic P systems simulating register machines (Q264529) (← links)
- Towards bridging two cell-inspired models: P systems and R systems (Q418800) (← links)
- Catalytic and communicating Petri nets are Turing complete (Q476166) (← links)
- Computational power of tissue P systems for generating control languages (Q506719) (← links)
- (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode (Q553919) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- Deterministic catalytic systems are not universal (Q860859) (← links)
- Using well-structured transition systems to decide divergence for catalytic P systems (Q872196) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Catalytic P systems, semilinear sets, and vector addition systems (Q1884955) (← links)
- From P systems to morphogenetic systems: an overview and open problems (Q1982993) (← links)
- P systems with limited number of objects (Q1982995) (← links)
- Division rules for tissue P systems inspired by space filling curves (Q1983011) (← links)
- How derivation modes and halting conditions may influence the computational power of P systems (Q1983020) (← links)
- Synchronization of rules in membrane computing (Q1983026) (← links)
- Rule synchronization for tissue P systems (Q2051764) (← links)
- Variants of derivation modes for which purely catalytic P systems are computationally complete (Q2139058) (← links)
- When catalytic P systems with one catalyst can be computationally complete (Q2152296) (← links)
- Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete (Q2152303) (← links)
- On the universality of purely catalytic P systems (Q2311266) (← links)
- Membrane automata for modeling biomolecular processes (Q2311302) (← links)
- On determinism versus nondeterminism in P systems (Q2575077) (← links)
- Properties of Membrane Systems (Q2890280) (← links)
- P Systems with Chained Rules (Q2890302) (← links)
- <font>P</font> SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH (Q3076611) (← links)
- FURTHER RESULTS ON TIME-FREE P SYSTEMS (Q3379514) (← links)
- PARTIAL HALTING IN <font>P</font> SYSTEMS (Q3401468) (← links)
- The power of synchronizing rules in membrane computing (Q6118652) (← links)
- Morphogenetic computing: computability and complexity results (Q6177192) (← links)