@article {893,
	title = {3-COL problem modelling using simple Kernel P systems},
	journal = {International Journal of Computer Mathematics},
	volume = {90},
	year = {2013},
	month = {10/2013},
	pages = {816-830},
	publisher = {Taylor and Francis},
	address = {London, UK},
	abstract = {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.},
	keywords = {3-colour problem, Formal Verification, kernel P systems, Membrane computing, Tissue P Systems},
	issn = {0020-7160},
	doi = {10.1080/00207160.2012.743712},
	url = {http://dx.doi.org/10.1080/00207160.2012.743712},
	author = {Marian Gheorghe and Florentin Ipate and Raluca Lefticaru and Mario J. P{\'e}rez-Jim{\'e}nez and Adrian Turcanu and Luis Valencia-Cabrera and Manuel Garc{\'\i}a-Quismondo and Laurentiu Mierla}
}
