Iso-array rewriting P systems with context-free iso-array rules
dc.contributor.author | Bhuvaneswari, K. | |
dc.contributor.author | Kalyani, T. | |
dc.contributor.author | Thomas, D. G. | |
dc.contributor.author | Nagar, A. K. | |
dc.contributor.author | Thamburaj, R. | |
dc.coverage.issue | 1 | cs |
dc.coverage.volume | 3 | cs |
dc.date.accessioned | 2014-06-12T08:46:31Z | |
dc.date.available | 2014-06-12T08:46:31Z | |
dc.date.issued | 2014 | cs |
dc.description.abstract | 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. | en |
dc.format | text | cs |
dc.format.extent | 1-16 | cs |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Mathematics for Applications. 2014, 3, č. 1, s. 1-16. ISSN 1805-3629. | cs |
dc.identifier.doi | 10.13164/ma.2014.01 | en |
dc.identifier.issn | 1805-3629 | |
dc.identifier.uri | http://hdl.handle.net/11012/34439 | |
dc.language.iso | en | cs |
dc.publisher | Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky | cs |
dc.relation.ispartof | Mathematics for Applications | en |
dc.relation.uri | http://ma.fme.vutbr.cz/archiv/3_1/ma_3_1_bhuvaneswari_et_al.pdf | cs |
dc.rights | © Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky | cs |
dc.rights.access | openAccess | en |
dc.title | Iso-array rewriting P systems with context-free iso-array rules | en |
dc.type.driver | article | en |
dc.type.status | Peer-reviewed | en |
dc.type.version | publishedVersion | en |
eprints.affiliatedInstitution.department | Ústav matematiky | cs |
eprints.affiliatedInstitution.faculty | Fakulta strojního inženýrství | cs |