Formal languages
Control mechanisms on #-context-free array grammars
Mathematical aspects of natural and formal languages
P systems with picture objects
Acta Cybernetica
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P systems with local graph productions
New Generation Computing - Membrane computing
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Using Membrane Computing for Obtaining Homology Groups of Binary 2D Digital Images
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
P systems and picture languages
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Rewriting P systems generating iso-picture languages
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Region-based segmentation of 2D and 3D images with tissue-like P systems
Pattern Recognition Letters
A P system model with pure context-free rules for picture array generation
Mathematical and Computer Modelling: An International Journal
P systems and computational algebraic topology
Mathematical and Computer Modelling: An International Journal
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Designing a new software tool for Digital Imagery based on P systems
Natural Computing: an international journal
Segmenting images with gradient-based edge detection using Membrane Computing
Pattern Recognition Letters
A quadsection algorithm for grammar-based image compression
Integrated Computer-Aided Engineering - Anniversary Volume: Celebrating 20 Years of Excellence
Hi-index | 0.00 |
We consider array languages (sets of picturesconsisting of symbols placed in the lattice points of the 2D grid) and thepossibility to handle them with P systems. After proving binary normal formsfor array matrix grammars (which, even in the case when no appearance checking isused, are known to generate the array languages of arbitrary array grammars), weprove 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 togenerate all computable array languages. Some open problems are also formulated.