A toolbox for simpler active membrane algorithms

被引:3
|
作者
Leporati, Alberto [1 ]
Manzoni, Luca [1 ]
Mauri, Giancarlo [1 ]
Porreca, Antonio E. [1 ]
Zandron, Claudio [1 ]
机构
[1] Univ Milano Bicocca, Dipartimento Informat Sistemist & Comunicaz, Viale Sarca 336-14, I-20126 Milan, Italy
关键词
Membrane computing; Computational complexity; P system with active membranes; P-SYSTEMS; COMPUTATIONAL-EFFICIENCY; DIVISION; RULES;
D O I
10.1016/j.tcs.2017.03.015
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show that recogniser P systems with active membranes can be augmented with a priority over their set of rules and any number of membrane charges without loss of generality, as they can be simulated by standard P systems with active membranes, in particular using only two charges. Furthermore, we show that more general accepting conditions, such as sending out several, possibly contradictory results and keeping only the first one, or rejecting by halting without output, are also equivalent to the standard accepting conditions. The simulations we propose are always without significant loss of efficiency, and thus the results of this paper can hopefully simplify the design of algorithms for P systems with active membranes. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:42 / 57
页数:16
相关论文
共 50 条
  • [41] Simpler algorithms for testing two-page book embedding of partitioned graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    THEORETICAL COMPUTER SCIENCE, 2018, 725 : 79 - 98
  • [42] Distilling router data analysis for faster and simpler dynamic IP lookup algorithms
    Geraci, F
    Grossi, R
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 580 - 592
  • [43] Enhancing the toolbox of fixed income active portfolio management
    Violi, R.
    Cellai, G.
    Potente, F.
    Puorro, A.
    PORTFOLIO AND RISK MANAGEMENT FOR PUBLIC INVESTORS PROCEEDINGS OF THE FIFTH JOINT BIS/WORLD BANK PUBLIC INVESTORS CONFERENCE, 2015, 29 : 96 - 121
  • [44] Deterministic algorithms for the Lovasz local lemma: Simpler, more general, and more parallel
    Harris, David G. G.
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (03) : 716 - 752
  • [45] Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 477 - 488
  • [46] Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
    Yijun Dong
    Per-Gunnar Martinsson
    Advances in Computational Mathematics, 2023, 49
  • [47] Simpler editing of graph-based segmentation hierarchies using zipping algorithms
    Golodetz, Stuart
    Voiculescu, Irina
    Cameron, Stephen
    PATTERN RECOGNITION, 2017, 70 : 44 - 59
  • [48] Approximation via cost sharing:: Simpler and better approximation algorithms for network design
    Gupta, Anupam
    Kumar, Amit
    Pal, Martin
    Roughgarden, Tim
    JOURNAL OF THE ACM, 2007, 54 (03)
  • [49] Faster and simpler width-independent parallel algorithms for positive semidefinite programming
    Peng, Richard
    Tangwongsan, Kanat
    Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2012, : 101 - 108
  • [50] Antithrombin Replacement and Extracorporeal Membrane Oxygenation: The time is ripe for a Simpler Solution
    Seelhammer, Troy G.
    Hamzah, Mohammed
    Wieruszewski, Patrick
    ASAIO JOURNAL, 2022, 68 (10) : E166 - E167