All Stories

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