Iso-array rewriting P systems with context-free iso-array rules

A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al. initially proposed array rewriting P systems by extending the notion of string rewriting P systems to arrays (2003). A theoretical model for picture generation using context-free iso-array grammar rules and puzzle iso-array grammar rules are introduced by Kalyani et al. (2004, 2006). Also iso-array rewriting P systems for iso-picture languages have been studied by Annadurai et al. (2008). In this paper we consider the context-free iso-array rules and context-free puzzle iso-array rules in iso-array rewriting P systems and examine the generative powers of these P systems.

Citation

Mathematics for Applications. 2014, 3, č. 1, s. 1-16. ISSN 1805-3629.
http://ma.fme.vutbr.cz/archiv/3_1/ma_3_1_bhuvaneswari_et_al.pdf

Document type

Peer-reviewed

Document version

Published version

Language of document

en

Document licence