The following pages link to Petr Sosík (Q264527):
Displayed 50 items.
- Small (purely) catalytic P systems simulating register machines (Q264529) (← links)
- P systems with proteins on membranes characterize PSPACE (Q388151) (← links)
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- A limitation of cell division in tissue P systems by PSPACE (Q473203) (← links)
- Computational power of cell separation in tissue P systems (Q506362) (← links)
- Membrane computing and complexity theory: A characterization of PSPACE (Q859989) (← links)
- Algebraic properties of substitution on trajectories (Q861260) (← links)
- Normal forms for spiking neural P systems (Q872205) (← links)
- On the weight of universal insertion grammars (Q924156) (← links)
- On the power of elementary features in spiking neural P systems (Q1035721) (← links)
- On the hierarchy of extended conditional tabled eco-grammar systems (Q1307851) (← links)
- Watson-Crick D0L systems: The power of one transition (Q1399987) (← links)
- The power of catalysts and priorities in membrane systems (Q1405585) (← links)
- The computational power of cell division in P systems: Beating down parallel computers? (Q1410767) (← links)
- Watson-Crick D0L systems: Generative power and undecidable problems. (Q1426440) (← links)
- Conditional tabled eco-grammar systems: The scattered contexts (Q1592927) (← links)
- Item:Q264527 (redirect page) (← links)
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata (Q1650340) (← links)
- A logical representation of \(\mathrm{P}\) colonies: an introduction (Q1709895) (← links)
- On the robust power of morphogenetic systems for time bounded computation (Q1749177) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Aspects of shuffle and deletion on trajectories (Q1770379) (← links)
- On properties of bond-free DNA languages (Q1779300) (← links)
- Universal computation with Watson-Crick D0L systems. (Q1853540) (← links)
- From P systems to morphogenetic systems: an overview and open problems (Q1982993) (← links)
- Morphogenetic systems for resource bounded computation and modeling (Q2056337) (← links)
- Computational universality and efficiency in morphogenetic systems (Q2104142) (← links)
- P colonies. Survey (Q2299890) (← links)
- P systems attacking hard problems beyond NP: a survey (Q2299891) (← links)
- Modeling plant development with M systems (Q2328334) (← links)
- Morphogenetic and homeostatic self-assembled systems (Q2400958) (← links)
- Generalized P colonies with passive environment (Q2413315) (← links)
- On the Power of Catalytic P Systems with One Catalyst (Q2789125) (← links)
- An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation (Q2805445) (← links)
- P Colonies with Evolving Environment (Q2975909) (← links)
- Selected Topics in Computational Complexity of Membrane Systems (Q3009341) (← links)
- Polynomial Complexity Classes in Spiking Neural P Systems (Q3067498) (← links)
- ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL <font>P</font> SYSTEMS (Q3076599) (← links)
- ORTHOGONAL SHUFFLE ON TRAJECTORIES (Q3076614) (← links)
- Autonomous Resolution Based on DNA Strand Displacement (Q3092341) (← links)
- (Q3396004) (← links)
- (Q3431243) (← links)
- Hairpin Structures in DNA Words (Q3618686) (← links)
- The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (Q3654379) (← links)
- (Q4231596) (← links)
- (Q4413843) (← links)
- (Q4437105) (← links)
- (Q4530009) (← links)
- Tissue P Systems with Cell Separation: Upper Bound by PSPACE (Q4649282) (← links)
- (Q4737926) (← links)