@article {190,
	title = {Generation of Diophantine Sets by Computing P Systems with External Output},
	journal = {Lecture Notes in Computer Science},
	volume = {2509},
	year = {2002},
	pages = {176-190},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In this paper a variant of P systems with external output designed to compute functions on natural numbers is presented. These P systems are stable under composition and iteration of functions. We prove that every diophantine set can be generated by such P systems; then, the universality of this model can be deduced from the theorem by Matiyasevich, Robinson, Davis and Putnam in which they establish that every recursively enumerable set is a diophantine set.},
	isbn = {978-3-540-44311-7},
	issn = {0302-9743},
	doi = {10.1007/3-540-45833-6_15},
	url = {http://dx.doi.org/10.1007/3-540-45833-6_15},
	author = {{\'A}lvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez}
}
