#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1996

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Anahí Gajardo, Andrés Moreira, Eric Goles Ch.
- Discrete Applied Mathematics
- 2002

The virtual ant introduced by C. Langton has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with the trajectory of a single ant. This proves the P-hardness of the system and implies, through the simulation of one dimensional cellular automata and Turing machines, the… (More)

Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nB × nA similarity matrix S whose real entry sij expresses how similar vertex j (in GA) is to vertex i (in GB) : we say that sij is their similarity score. The similarity matrix can be… (More)

- G Bugedo, J Gonzalez, +5 authors J Dagnino
- British journal of anaesthesia
- 1999

We have performed a prospective, randomized, double-blind clinical study to assess the efficacy of ondansetron, droperidol, or both, in preventing postoperative emesis. We studied 242 patients undergoing biliary or gynaecological surgery under general anaesthesia. Shortly before induction of anaesthesia, patients received: saline i.v. (group I, n = 62);… (More)

- Anahí Gajardo, Eric Goles Ch., Andrés Moreira
- STACS
- 2001

Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between characteristics of finite graphs and the dynamics of the ant on them. Then we consider the infinite bi-regular graphs of degrees 3 and 4, where we prove the universality of the… (More)

- Vincent D. Blondel, Anahí Gajardo, Maureen Heymans, Pierre Senellart, Paul Van Dooren
- SIAM Review
- 2004

We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB ×nA similarity matrix S whose real entry sij expresses how similar vertex j (in GA) is to vertex i (in GB): we say that sij is their similarity score. The similarity matrix can be obtained as… (More)

- Anahí Gajardo, Eric Goles Ch.
- Theor. Comput. Sci.
- 2006

- Anahí Gajardo, Jacques Mazoyer
- Theor. Comput. Sci.
- 2007

- Anahí Gajardo, Eric Goles Ch.
- Theor. Comput. Sci.
- 2004

- Andrés Moreira, Anahí Gajardo, Eric Goles Ch.
- Complexity
- 2001

O ne of the first models of artificial life, proposed back in the 1980s by Christopher Langton, founder of the field, was the virtual ant [1,2]. This simple cellular automaton is defined on the square grid in the following way: each square (“cell”) of the grid can be in one of two states, white or black, and the ant is represented by a short arrow that… (More)

- Andrés Moreira, Anahí Gajardo
- JAC
- 2010

Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward time directions. This notion, found in physical theories, has been neglected in the area of discrete dynamical systems. Here we formalize it in the context of cellular automata and… (More)