Determining a regular language by glider-based structures called phases fi_1 in Rule 110

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi_1 for each glider in Rule 110. The subset of regular expressions is explained in detail.
by publish in Journal of Cellular Automata

Keywords

Cellular Automata and Lattice Gases

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132278

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0706.3348
 http://arxiv.org/abs/0706.3348

Collections

arXiv