<?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%">Gheorghe Paun</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">dP automata versus right-linear simple matrix grammars</style></title><secondary-title><style face="normal" font="default" size="100%">Ninth Brainstorming Week on Membrane Computing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Proceedings of the Ninth Brainstorming Week on Membrane Computing</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.gcn.us.es/9BWMC/volume/21dPsystemsCris.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Fénix Editora</style></publisher><pub-location><style face="normal" font="default" size="100%">Seville, Spain</style></pub-location><pages><style face="normal" font="default" size="100%">293-304</style></pages><abstract><style face="normal" font="default" size="100%">We consider dP automata with the input string distributed in an arbitrary
(hence not necessary balanced) way, and we investigate their language accepting power,
both in the case when a bound there is on the number of objects present inside the system
and in the general case. The relation with right-linear simple matrix grammars is useful
in this respect. Some research topics and open problems are also formulated.</style></abstract></record></records></xml>