Contextual array P systems
01 Aug 2004-International Journal of Computer Mathematics (Taylor & Francis)-Vol. 81, Iss: 8, pp 955-969
TL;DR: The relation between external arrays contextual P systems and external array contextual grammars with regular control is obtained and some properties of these systems are discussed.
Abstract: We define external and internal array contextual P systems, which generate rectangular arrays. We also introduce external array contextual P systems with erased contexts. Some properties of these systems are discussed. We obtain the relation between external array contextual P systems and external array contextual grammars with regular control.
Citations
More filters
TL;DR: It is proved that the P systems with context-free rules are computationally universal, able to generate all computable array languages.
Abstract: We consider array languages (sets of pictures consisting of symbols placed in the lattice points of the 2D grid) and the possibility to handle them with P systems. After proving binary normal forms for array matrix grammars (which, even in the case when no appearance checking is used, are known to generate the array languages of arbitrary array grammars), we prove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able to generate all computable array languages. Some open problems are also formulated.
84 citations
01 Mar 2019
TL;DR: Some of the open research lines in the area of membrane computing are presented, focusing on segmentation problems, skeletonization and algebraic-topological aspects of the images.
Abstract: Membrane computing is a well-known research area in computer science inspired by the organization and behavior of live cells and tissues. Their computational devices, called P systems, work in parallel and distributed mode and the information is encoded by multisets in a localized manner. All these features make P systems appropriate for dealing with digital images. In this paper, some of the open research lines in the area are presented, focusing on segmentation problems, skeletonization and algebraic-topological aspects of the images. An extensive bibliography about the application of membrane computing to the study of digital images is also provided.
64 citations
TL;DR: A parallel implementation of a new algorithm for segmenting images with gradient-based edge detection by using techniques from Natural Computing, implemented in a novel device architecture called CUDA(TM)(Compute Unified Device Architecture).
57 citations
TL;DR: This paper discusses research frontiers of membrane computing by presenting current open problems and research topics, together with the relevant background and motivation.
Abstract: This paper discusses research frontiers of membrane computing by presenting current open problems and research topics, together with the relevant background and motivation.
47 citations
01 Jan 2012
TL;DR: A list of open problems and research topics collected after the Twelfth Conference on Membrane Computing, CMC 2012 (Fontainebleau, France) was meant initially to be a working material for the Tenth Brainstorming Week on MEMBRANE Computing, Sevilla, Spain (January 30 February 3, 2012) as mentioned in this paper.
Abstract: This is a list of open problems and research topics collected after the Twelfth Conference on Membrane Computing, CMC 2012 (Fontainebleau, France (23 26 August 2011), meant initially to be a working material for Tenth Brainstorming Week on Membrane Computing, Sevilla, Spain (January 30 February 3, 2012). The result was circulated in several versions before the brainstorming and then modified according to the discussions held in Sevilla and according to the progresses made during the meeting. In the present form, the list gives an image about key research directions currently active in membrane computing.
45 citations
References
More filters
Journal Article•
TL;DR: This paper describes in this paper a normal form for the class of non-cooperative P-systems and proves a normalization theorem, which proves that the hierarchy ofnon-co cooperative P- systems with respect to depth collapses on the second level.
Abstract: The P-systems have been recently introduced in [4] as a new model for distributed parallel computing. We describe in this paper a normal form for the class of non-cooperative P-systems and prove a normalization theorem. By this result, we also prove that the hierarchy of non-cooperative P-systems with respect to depth collapses on the second level.
27 citations
Proceedings Article•
[...]
02 Dec 1986
TL;DR: This tutorial briefly introduces array grammars, in which rewriting rules involve replacement of subarrays bySubarrays, and the extension to arbitrary dimensions is straightforward.
20 citations
Journal Article•
[...]
TL;DR: This paper considers the contextual way of handling string-objects in P systems and proves that contextual P systems with rules corresponding to these variants are more powerful than ordinary contextual grammars and their variants.
Abstract: Generally, in P systems with string-objects one uses the Chomsky way of rewriting for processing the objects. In this paper we consider the contextual way of handling string-objects in P systems. We introduce some variants of contextual grammars and prove that contextual P systems with rules corresponding to these variants are more powerful than ordinary contextual grammars and their variants. We also show that one-sided contextual P systems with right-sided erased contexts and insertion contextual P systems with right-sided erased contexts are computationally complete.
17 citations