output
20032009
most citedCommunications in cellular automata

4 citations

Showing 2003Show all

6 papers · 1 filter

math.CO2003

Expected length of the longest common subsequence for large alphabets

Marcos Kiwi, Martin Loebl, Jiri Matousek

We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…

nlin.CG20032 cited

Universality and Decidability of Number-Conserving Cellular Automata

Andres Moreira

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions…

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…

nlin.CG2003

On Conservative and Monotone One-dimensional Cellular Automata and Their Particle Representation

Andres Moreira, Nino Boccara, Eric Goles

Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of…

physics.bio-ph2003

Genetic Algorithms for the Imitation of Genomic Styles in Protein Backtranslation

Andres Moreira

Several technological applications require the translation of a protein into a nucleic acid that codes for it (``backtranslation''). The degeneracy of the genetic code makes this t…

math.CO2003

Domino tilings and related models: space of configurations of domains with holes

Sebastien Desreux, Martin Matamala, Ivan Rapaport +1

We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretat…