Author
Rodica Ceterchi
Other affiliations: Rovira i Virgili University
Bio: Rodica Ceterchi is an academic researcher from University of Bucharest. The author has contributed to research in topics: Rewriting & Membrane computing. The author has an hindex of 9, co-authored 44 publications receiving 341 citations. Previous affiliations of Rodica Ceterchi include Rovira i Virgili University.
Topics: Rewriting, Membrane computing, Sorting algorithm, Sorting, Peano curve
Papers
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
Journal Article•
TL;DR: A variant of tissue-like P systems with symport rules and active membranes that generates two-dimensional picture languages that is illustrated by its application to the generation of local and recognizable picture languages.
Abstract: We propose a variant of tissue-like P systems with symport rules and active membranes that generates two-dimensional picture languages. The method is unconventional in that, instead of using the membranes as regions for computation/writing, it uses them to hold elements of pictures. Thus, the picture itself, and actually the whole supporting rectangular grid, is composed of membranes, each one containing (among other symbols) a letter of the picture's alphabet. The method is illustrated by its application to the generation of local and recognizable picture languages.
37 citations
17 Jul 2006
TL;DR: This paper presents the use of P systems and π-calculus to model interacting molecular entities and how they are translated into a probabilistic and symbolic model checker called PRISM.
Abstract: This paper presents the use of P systems and π-calculus to model interacting molecular entities and how they are translated into a probabilistic and symbolic model checker called PRISM.
31 citations
TL;DR: A model for simulating Boolean circuits with P systems, with type of P systems used is with symbol objects, context-free rewriting rules and some other features like mobile catalysts, weak priorities and promoters.
Abstract: We propose a model for simulating Boolean circuits with P systems. The simulation is done in two steps, by first simulating the gates of such a circuit, and next by showing how these can be combined to obtain actual circuits. The type of P systems used is with symbol objects, context-free rewriting rules and some other features like mobile catalysts, weak priorities and promoters.
27 citations
TL;DR: The modelling capabilities of Kernel P systems are illustrated by showing how other classes of P systems can be represented with this formalism and providing a number of kernel P system models for a sorting algorithm and a broadcasting problem.
16 citations
Cited by
More filters
368 citations
TL;DR: A novel method of constructing logic circuits that work in a neural-like manner is demonstrated, as well as shed some lights on potential directions of designing neural circuits theoretically.
121 citations
01 Mar 2008
TL;DR: This paper explains how biological pathways can be modelled in the probabilistic model checker PRISM and how this enables the analysis of a rich selection of quantitative properties and shows how it can yield a better understanding of the dynamics of these systems.
Abstract: Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, including security and communication protocols, distributed algorithms and power management. In this paper we demonstrate its applicability to the analysis of biological pathways and show how it can yield a better understanding of the dynamics of these systems. Through a case study of the MAP (Mitogen-Activated Protein) Kinase cascade, we explain how biological pathways can be modelled in the probabilistic model checker PRISM and how this enables the analysis of a rich selection of quantitative properties.
113 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