Generalized langton's ant: Dynamical behavior and complexity

Anahí Gajardo, Eric Goles, Andrés Moreira

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

8 Citas (Scopus)

Resumen

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 system, and in the particular cases of the square and the hexagonal grids, we associate a P-hard problem to the dynamics. Finally, we show strong spatial restrictions on the trajectory of the ant in infinite bi-regular graphs with degrees strictly greater than 4, which contrasts with the high unpredictability on the graphs of lower degrees.

Idioma originalInglés
Título de la publicación alojadaSTACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditoresAfonso Ferreira, Horst Reichel
EditorialSpringer Verlag
Páginas259-270
Número de páginas12
ISBN (versión impresa)9783540416951
DOI
EstadoPublicada - 2001
Publicado de forma externa
Evento18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 - Dresden, Alemania
Duración: 15 feb. 200117 feb. 2001

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen2010
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001
País/TerritorioAlemania
CiudadDresden
Período15/02/0117/02/01

Huella

Profundice en los temas de investigación de 'Generalized langton's ant: Dynamical behavior and complexity'. En conjunto forman una huella única.

Citar esto