Formal languages
Journal of Computer and System Sciences
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Iterated GSM Mappings: A Collapsing Hierarchy
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Automata or Purely Communicating Accepting P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
On three classes of automata-like P systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Defining and Executing P Systems with Structured Data in K
Membrane Computing
P machines: an automata approach to membrane computing
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Encodings and arithmetic operations in membrane computing
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Theoretical Computer Science
| Hi-index | 0.00 |
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.