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

Martinez, Genaro J.; McIntosh, Harold V.; Mora, Juan C.S.T; Vergara, Sergio V.C.

Abstract

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.

• Journal Article Type: Article
• Publication Date: Jan 1, 2008
• Deposit Date: Jul 26, 2010
• Publicly Available Date: Feb 10, 2016
• Journal: Journal of Cellular Automata
• Print ISSN: 1557-5969
• Electronic ISSN: 1557-5977
• Publisher: Old City Publishing
• Peer Reviewed: Peer Reviewed
• Volume: 3
• Issue: 3
• Pages: 231-270
• Keywords: glider-based structures, rule 110
• Public URL: https://uwe-repository.worktribe.com/output/1020237
• Publisher URL: http://www.oldcitypublishing.com/JCA/JCAcontents/JCAv3n3contents.html
• Contract Date: Feb 10, 2016