activity
20032023
most citedZigzags in Turing machines

9 citations · 12 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2023★ 1 cited

Separating path systems in trees

Francisco Arrepol, Patricio Asenjo, Raúl Astete +6

For a graph , an edge-separating (resp. vertex-separating) path system of is a family of paths in such that for any pair of edges (resp. pair of vertices $v_1…

cs.CC2017

Nontrivial Turmites are Turing-universal

Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus +1

A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, d…

cs.DM2016★ 2 cited

Pre-Expansivity in Cellular Automata

A. Gajardo, V. Nesme, Guillaume Theyssier

We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that diffe…

cs.DM2010

Time-Symmetric Cellular Automata

Andrés Moreira, Anahi Gajardo

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 t…

cs.FL2010★ 9 cited

Zigzags in Turing machines

Anahi Gajardo, Pierre Guillon

We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r…

nlin.CG2003

Complexity of Langton's Ant

Anahi Gajardo, Andres Moreira, Eric Goles

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…