The following pages link to (Q4329021):
Displaying 12 items.
- Computational efficiency and universality of timed P systems with active membranes (Q487991) (← links)
- P systems with active membranes: Trading time for space (Q537818) (← links)
- Multiset random context grammars, checkers, and transducers (Q872199) (← links)
- Three ``quantum'' algorithms to solve 3-SAT (Q872207) (← links)
- Results on catalytic and evolution-communication P systems (Q1762941) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Cell-like P systems with polarizations and minimal rules (Q2306012) (← links)
- \(P\) systems with active membranes and without polarizations (Q2576608) (← links)
- (UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power (Q5452047) (← links)
- Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes (Q5452050) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
- Computing with energy and chemical reactions (Q5962072) (← links)
