Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A symbolic projectio ...
Conference paper

A symbolic projection of Langton's Ant

Anahi Gajardo (1) (2)
(1) Universidad de Concepción - University of Concepcion [Chile]
(2) Universidad de Concepción = University of Concepción [Chile]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AB, Discrete Models for Complex Systems (DMCS'03)
Proceedings
DOI
10.46298/dmtcs.2312
License
https://about.hal.science/hal-authorisation-v1
Indicators
861
Views
630
Downloads

A symbolic projection of Langton's Ant

Anahi Gajardo (1) (2)
(1) Universidad de Concepción - University of Concepcion [Chile]
(2) Universidad de Concepción = University of Concepción [Chile]
Abstract
The Langton's ant is studied from the point of view of topological dynamical systems. A new approach which associate a subshift to the system is proposed.The transition rule is generalized to the family of bi-regular graphs $\Gamma(k,d)$ and the dependence of the dynamical system on $k$ and $d$ is analyzed. A classification of the $\Gamma (k,d)$ graphs based on the dynamical properties of the subshift is established. Also a hierarchy is defined on the graphs through the subset relation of the respective subshifts. The analysis are worked out by establishing an algebraic characterization of the forbidden words of the subshift.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG]
  • Symbolic Dynamics
  • Lorentz Lattice Gas
  • Cayley Graphs
Mathematics Subject Classification 2020
  • 05C05 - Trees
  • 05C10 - Planar graphs; geometric and topological aspects of graph theory
Cited by

Source: OpenCitations

  • Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata

    IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

    Authors : Takeo HAGIWARA, Tatsuie TSUKIJI ORCID, Zhi-Zhong CHEN ORCID

    Journal reference : Volume E99.A, 2016, pp. 1034-1049

    DOI : 10.1587/transfun.e99.a.1034
  • One Head Machines from a symbolic approach

    Theoretical Computer Science

    Authors : A. Gajardo ORCID, J. Mazoyer

    Journal reference : Volume 370, 2006, pp. 34-47

    DOI : 10.1016/j.tcs.2006.10.004
Preview
Loading PDF preview...