<?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%">Gabriel Ciobanu</style></author><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author><author><style face="normal" font="default" size="100%">Gheorghe Stefanescu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">P Transducers</style></title><secondary-title><style face="normal" font="default" size="100%">New Generation Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">chomsky hierarchy</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">transducer</style></keyword><keyword><style  face="normal" font="default" size="100%">turing machine</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2006</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/5640181578u716hl/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Ohmsha, Ltd.</style></publisher><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">1-28</style></pages><abstract><style face="normal" font="default" size="100%">We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The “Sevilla carpet” of a computation is defined for P transducers, giving a representation of the control part for these P transducers. </style></abstract></record></records></xml>