Fernando Sancho Caparrini

TL;DR: Four complexity classes for cellular computing systems with membranes are introduced and the usefulness of these classes is illustrated by solving two NP–completeproblems, namely HPP and SAT, in both variants of P systems.

TL;DR: The complexity class PMCF of all decision problems solvable in polynomial time by a family of P systems belonging to a given class of membrane systems with input, F, is introduced and it is shown that the class NP is contained in the above mentioned complexity class.

TL;DR: A new dataset obtained from a real CCTV installed in a university and the generation of synthetic images are presented, resulting in a weapon detection model able to be used in quasi real-time CCTV improving the state of the art on weapon detection in a two stages training.

TL;DR: This paper introduces the complexity class PMCF of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.