%0 Generic
%D 2006
%T P Transducers
%A Gabriel Ciobanu
%A Gheorghe Paun
%A Gheorghe Stefanescu
%C Tokyo, JapĆ³n
%K chomsky hierarchy
%K Membrane computing
%K transducer
%K turing machine
%N 1
%P 1-28
%U http://portal.acm.org/citation.cfm?id=1163790
%V 24
%X 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.