Please use this identifier to cite or link to this item:
|Citation:||Ciobanu, G., Pǎun, G., Ştefǎnescu, G. (2006). P transducers. New Generation Computing 24 (1) : 1-28. ScholarBank@NUS Repository. https://doi.org/10.1007/BF03037291|
|Abstract:||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.|
|Source Title:||New Generation Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 16, 2018
WEB OF SCIENCETM
checked on May 23, 2018
checked on Jun 30, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.