Transducers based on networks of evolutionary processors LOS FINANCIADORES NO ESTÁN BIEN

Gómez Canaval, Sandra and Mitrana, Victor and Alonso Villaverde, Santiago (2014). Transducers based on networks of evolutionary processors LOS FINANCIADORES NO ESTÁN BIEN. "Journal of Automata, Languages and Combinatorics", v. 19 (n. 1-4); pp. 93-105. ISSN 1430-189X.

Description

Title: Transducers based on networks of evolutionary processors LOS FINANCIADORES NO ESTÁN BIEN
Author/s:
  • Gómez Canaval, Sandra
  • Mitrana, Victor
  • Alonso Villaverde, Santiago
Item Type: Article
Título de Revista/Publicación: Journal of Automata, Languages and Combinatorics
Date: 2014
Volume: 19
Subjects:
Freetext Keywords: Evolutionary rule; network of evolutionary processors; generalized sequential machine; NEP transducer
Faculty: E.T.S.I. de Sistemas Informáticos (UPM)
Department: Sistemas Informáticos
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (873kB) | Preview

Abstract

We consider a new type of transducer that does not scan sequentially the input word. Instead, it consists of a directed graph whose nodes are processors which work in parallel and are specialized in just one type of a very simple evolutionary operation: inserting, deleting or substituting a symbol by another one. The computation on an input word starts with this word placed in a designated node, the input node, of the network an alternates evolutionary and communication steps. The computation halts as soon as another designated node, the output node, is nonempty. The translation of the input word is the set of words existing in the output node when the computation halts. We prove that these transducers can simulate the work of generalized sequential machines on every input. Furthermore, all words obtained by a given generalized sequential machine 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 de?ned by the new transducer of a very simple regular language. The same idea may be used for proving that these transducers can simulate the shortest computations of an arbitrary Turing machine, used as a transducer, on every input word. Finally, we consider a restricted variant of NEP transducer, namely pure NEP transducers and prove that there are still regular languages whose pure NEP transductions are not semilinear.

Funding Projects

TypeCodeAcronymLeaderTitle
UnspecifiedUnspecifiedUnspecifiedUnspecifiedTIN2011-28260-C03-03

More information

Item ID: 39891
DC Identifier: http://oa.upm.es/39891/
OAI Identifier: oai:oa.upm.es:39891
Official URL: http://www.jalc.de/
Deposited by: Memoria Investigacion
Deposited on: 11 May 2017 18:26
Last Modified: 11 May 2017 20:23
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM