All Stories

  1. An overview on simple P systems with specific variants of derivation modes
  2. Universality of Turing Tumble of Finite Size
  3. Variants of Tissue P Systems with Prescribed Teams of Channel Rules
  4. A 15-Year Retrospective on Insertion-Deletion Systems: Progress, Evolution, and Future Directions
  5. Generalized Distributed Reaction Systems
  6. Variants of derivation modes for which purely catalytic P systems are computationally complete
  7. Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete
  8. Relations between Control Mechanisms for Sequential Grammars1
  9. When catalytic P systems with one catalyst can be computationally complete
  10. Alternative space definitions for P systems with active membranes
  11. A formal framework for spiking neural P systems
  12. Local Synchronization on Asynchronous Tissue P Systems With Symport/Antiport Rules
  13. P systems with randomized right-hand sides of rules
  14. Time-freeness and clock-freeness and related concepts in P systems
  15. Variants of P systems with activation and blocking of rules
  16. Computation power of asynchronous spiking neural P systems with polarizations
  17. P Systems with Activation and Blocking of Rules
  18. Sequential Grammars with Activation and Blocking of Rules
  19. Small Universal Reversible Counter Machines
  20. Chocolate P Automata
  21. Simulating Evolutional Symport/Antiport by Evolution-Communication and vice versa in Tissue P Systems with Parallel Communication
  22. Hierarchical P Systems with Randomized Right-Hand Sides of Rules
  23. Extended spiking neural P systems with white hole rules and their red–green variants
  24. Small asynchronous P systems with inhibitors defining non-semilinear sets
  25. (Tissue) P Systems with Vesicles of Multisets
  26. Contextual array grammars with matrix control, regular control languages, and tissue P systems control
  27. P Systems Working in Maximal Variants of the Set Derivation Mode
  28. Purely Catalytic P Systems over Integers and Their Generative Power
  29. Simulating R Systems by P Systems
  30. Particle Complexity of Universal Finite Number-Conserving Cellular Automata
  31. Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
  32. Bridging Deterministic P Systems and Conditional Grammars
  33. Polarizationless P Systems with One Active Membrane
  34. Small P Systems Defining Non-semilinear Sets
  35. Variants of Small Universal P Systems with Catalysts
  36. Space complexity equivalence of P systems with active membranes and Turing machines
  37. A P System for Annotation of Romanian Affixes
  38. Antimatter as a Frontier of Tractability in Membrane Computing
  39. Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete
  40. Length P Systems
  41. Matter and Anti-Matter in Membrane Systems
  42. Membrane Computing
  43. P System Computational Model as Framework for Hybrid (Membrane-Quantum) Computations
  44. P Systems with Anti-Matter
  45. P Systems with Toxic Objects
  46. Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems
  47. Promoters and Inhibitors in Purely Catalytic P Systems
  48. Small Universal Devices
  49. Forward and Backward Chaining with P Systems
  50. RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
  51. Characterizing the computational power of energy-based P systems
  52. One-membrane symport with few extra symbols
  53. A P System Parsing Word Derivatives
  54. Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN
  55. Sequential P Systems with Regular Control
  56. Turing Computability and Membrane Computing
  57. ON SMALL UNIVERSAL SPLICING SYSTEMS
  58. Circular Post Machines and P Systems with Exo-insertion and Deletion
  59. Properties of Membrane Systems
  60. Sequential and maximally parallel multiset rewriting: reversibility and determinism
  61. Minimization strategies for maximally parallel multiset rewriting systems
  62. Forward and Backward Chaining with P Systems
  63. SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS
  64. P systems with minimal insertion and deletion
  65. About Complete Obligatory Hybrid Networks of Evolutionary Processors without Substitution
  66. Complete Obligatory Hybrid Networks of Evolutionary Processors
  67. P Systems with Insertion and Deletion Exo-Operations
  68. Small Size Insertion and Deletion Systems
  69. A sequence-based analysis of the pointer distribution of stichotrichous ciliates
  70. Computing the graph-based parallel complexity of gene assembly
  71. A Small Universal Splicing P System
  72. On Reversibility and Determinism in P Systems
  73. On Universality of Radius 1/2 Number-Conserving Cellular Automata
  74. Polymorphic P Systems
  75. Reversibility and Determinism in Sequential Multiset Rewriting
  76. The Family of Languages Generated by Non-cooperative Membrane Systems
  77. Dictionary Search and Update by P Systems with String-Objects and Active Membranes
  78. On the size of computationally complete hybrid networks of evolutionary processors
  79. The parallel complexity of signed graphs: Decidability results and an improved algorithm
  80. Fast Synchronization in P Systems
  81. Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
  82. Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
  83. On Networks of Evolutionary Processors with Nodes of Two Types
  84. Solutions to computational problems through gene assembly
  85. MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS
  86. P systems without multiplicities of symbol-objects
  87. On the number of nodes in universal networks of evolutionary processors
  88. Membrane division, restricted membrane creation and object complexity in P systems
  89. Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
  90. CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES
  91. Computational Power of Symport/Antiport: History, Advances, and Open Problems
  92. Extended Spiking Neural P Systems
  93. Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness
  94. Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules
  95. Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes
  96. Communicative P Systems with Minimal Cooperation
  97. Computational Completeness of P Systems with Active Membranes and Two Polarizations
  98. Computing by Observing Bio-systems: The Case of Sticker Systems
  99. On the Efficiency of P Systems with Active Membranes and Two Polarizations
  100. One and two polarizations, membrane creation and objects complexity in P systems
  101. Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells
  102. Ultimately Confluent Rewriting Systems. Parallel Multiset–Rewriting with Permitting or Forbidding Contexts
  103. Trading polarizations for labels in P systems with active membranes
  104. Minimizing evolution-communication P systems and automata
  105. Further remarks on P systems with active membranes, separation, merging, and release rules
  106. Proton Pumping P Systems
  107. Solving Graph Problems by P Systems with Restricted Elementary Active Membranes
  108. About Universal Hybrid Networks of Evolutionary Processors of Small Size
  109. Forward and Backward Chaining with P Systems
  110. Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
  111. Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes
  112. Solutions to Computational Problems Through Gene Assembly
  113. Static Sorting P Systems