Determining a regular language by glider-based structures called phases fi-1 in rule 110

Genaro J. Martínez; Harold V. McIntosh; Juan C.Seck Tuoh Mora; Sergio V.Chapa Vergara

Determining a regular language by glider-based structures called phases f_i-1 in rule 110

Genaro J. Martínez, Harold V. McIntosh, Juan C.Seck Tuoh Mora, Sergio V.Chapa Vergara

Escuela Superior de Cómputo (ESCOM)

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

15 Citas (Scopus)

Resumen

Rule 110 is a complex elementary cellular automaton able of support 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 f_i-1 for each glider in Rule 110. The subset of regular expressions is explained in detail.

Idioma original	Inglés
Páginas (desde-hasta)	231-270
Número de páginas	40
Publicación	Journal of Cellular Automata
Volumen	3
N.º	3
Estado	Publicada - 2008

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

@article{de7e1c7d4d084a90a40f1fc57bafad77,

title = "Determining a regular language by glider-based structures called phases fi-1 in rule 110",

abstract = "Rule 110 is a complex elementary cellular automaton able of support 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.",

keywords = "Cellular automata, De Bruijn diagrams and regular expressions, Rule 110",

author = "Mart{\'i}nez, {Genaro J.} and McIntosh, {Harold V.} and Mora, {Juan C.Seck Tuoh} and Vergara, {Sergio V.Chapa}",

year = "2008",

language = "Ingl{\'e}s",

volume = "3",

pages = "231--270",

journal = "Journal of Cellular Automata",

issn = "1557-5969",

publisher = "Old City Publishing",

number = "3",

}

TY - JOUR

T1 - Determining a regular language by glider-based structures called phases fi-1 in rule 110

AU - Martínez, Genaro J.

AU - McIntosh, Harold V.

AU - Mora, Juan C.Seck Tuoh

AU - Vergara, Sergio V.Chapa

PY - 2008

Y1 - 2008

N2 - Rule 110 is a complex elementary cellular automaton able of support 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.

AB - Rule 110 is a complex elementary cellular automaton able of support 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.

KW - Cellular automata

KW - De Bruijn diagrams and regular expressions

KW - Rule 110

UR - http://www.scopus.com/inward/record.url?scp=77952481610&partnerID=8YFLogxK

M3 - Artículo

AN - SCOPUS:77952481610

SN - 1557-5969

VL - 3

SP - 231

EP - 270

JO - Journal of Cellular Automata

JF - Journal of Cellular Automata

IS - 3

ER -

Determining a regular language by glider-based structures called phases fi-1 in rule 110

Resumen

Otros archivos y enlaces

Huella

Citar esto

Determining a regular language by glider-based structures called phases f_i-1 in rule 110