|
Descripción
|
|
|---|---|
| We consider a new type of transducer that does not scan sequentially the input word. This transducer is actually a network of polarized evolutionary processors (NPEP) which receives a word as input and collects in the output node, when the computation halts, the translation of the input word. We prove that these transducers can simulate the work of generalized sequential machines on every input. Furthermore, all words obtained by a given finite state transducer by the shortest computations on a given word can also be computed by the new transducers. Unlike the case of generalized sequential machines, every recursively enumerable language can be the transduction, defined by the new transducer, of a very simple regular language. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Theoretical Computer Science |
|
ISSN
|
0304-3975 |
|
Factor de impacto JCR
|
0,643 |
|
Información de impacto
|
Datos JCR del año 2013 |
|
Volumen
|
- |
|
DOI
|
http://dx.doi.org/10.1016/j.tcs.2016.10.014 |
|
Número de revista
|
- |
|
Desde la página
|
- |
|
Hasta la página
|
- |
|
Mes
|
NOVIEMBRE |
|
Ranking
|
ISI de la Web of Science |