<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marian Gheorghe</style></author><author><style face="normal" font="default" size="100%">Florentin Ipate</style></author><author><style face="normal" font="default" size="100%">Raluca Lefticaru</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Adrian Turcanu</style></author><author><style face="normal" font="default" size="100%">Luis Valencia-Cabrera</style></author><author><style face="normal" font="default" size="100%">Manuel García-Quismondo</style></author><author><style face="normal" font="default" size="100%">Laurentiu Mierla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">3-COL problem modelling using simple Kernel P systems</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Computer Mathematics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">3-colour problem</style></keyword><keyword><style  face="normal" font="default" size="100%">Formal Verification</style></keyword><keyword><style  face="normal" font="default" size="100%">kernel P systems</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Tissue P Systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1080/00207160.2012.743712</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Taylor and Francis</style></publisher><pub-location><style face="normal" font="default" size="100%">London, UK</style></pub-location><volume><style face="normal" font="default" size="100%">90</style></volume><pages><style face="normal" font="default" size="100%">816-830</style></pages><abstract><style face="normal" font="default" size="100%">This paper presents the newly introduced class of (simple) kernel P systems ((s)kP systems) and investigates through a 3-colouring problem case study the expressive power and efficiency of kernel P systems. It describes two skPsystems that model the problem and analyzes them in terms of efficiency and complexity. The skP models prove to be more succinct (in terms of number of rules, objects, number of cells and execution steps) than the corresponding tissue P system, availablein the literature, that solves the same problem, at the expense of a greater length of the rules.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue><custom1><style face="normal" font="default" size="100%">0.542</style></custom1><custom2><style face="normal" font="default" size="100%">173/247 - Q3</style></custom2></record></records></xml>