#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1994

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Juan Castellanos, Carlos Martín-Vide, Victor Mitrana, José M. Sempere
- Acta Informatica
- 2003

In this paper we consider networks of evolutionary processors as language generating and computational devices. When the filters are regular languages one gets the computational power of Turing machines with networks of size at most six, depending on the underlying graph. When the filters are defined by random context conditions, we obtain an… (More)

- José M. Sempere, G. Nagaraja
- ICGI
- 1998

- Peter Leupold, Victor Mitrana, José M. Sempere
- Aspects of Molecular Computing
- 2004

- Damián López, José M. Sempere, Pedro García
- IEEE Trans. Systems, Man, and Cybernetics, Part B
- 2004

In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-testable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language classes in relation to other well known ones, and some properties… (More)

- José M. Sempere
- Journal of Automata, Languages and Combinatorics
- 2000

- José M. Sempere, Antonio Fos
- ICGI
- 1996

A bstract.Lin ear lan guage class is a su bclass of context-free lan guage class. In t his paper, we propose an algorithm to learn linear languages from structural information of t heir strings. We compare our algorithm with other ad apt ed algorit hm from Radhakrishnan an d Nagaraja [RN1]. The proposed method and the adapt ed algorithm are heuristic… (More)

- Florin Manea, Victor Mitrana, José M. Sempere
- Developments in Language Theory
- 2009

In this note we solve a problem left open in [2]: namely, we show that the iterated superposition of a regular language is regular. The proof of this result is based on two facts: (i) the iterated superposition of a language equals the restricted iterated superposition of the same language, (ii) the sequence formed by iteratively applying the restricted… (More)

In this paper we simplify the model of computation considered in [1], namely network of evolutionary picture processors, by moving the filters from the nodes to the edges. Each edge is now viewed as a twoway channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the… (More)

We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NP-complete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed. ∗Research supported by… (More)

The rapid growth of protein sequence databases is exceeding the capacity of biochemically and structurally characterizing new proteins. Therefore, it is very important the development of tools to locate, within protein sequences, those subsequences with an associated function or specific feature. In our work, we propose a method to predict one of those… (More)