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

Martinez, G. J., McIntosh, H. V., Mora, J. C. and Vergara, S. V. (2008) Determining a regular language by glider-based structures called phases fi_1 in Rule 110. Journal of Cellular Automata, 3 (3). pp. 231-270. ISSN 1557-5969

[img]
Preview
PDF - Published Version
338kB

Publisher's URL: http://www.oldcitypublishing.com/JCA/JCAcontents/J...

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.

Item Type:Article
Uncontrolled Keywords:glider-based structures, rule 110
Faculty/Department:Faculty of Environment and Technology
ID Code:10578
Deposited By: A. Lawson
Deposited On:26 Jul 2010 12:40
Last Modified:23 May 2014 05:54

Request a change to this item

Total Document Downloads in Past 12 Months

Document Downloads

Total Document Downloads

More statistics for this item...
Copyright 2013 © UWE better together