Determining a regular language by glider-based structures called phases fi_1 in Rule 110
Martinez, G. J. print, McIntosh, H. V. print, Mora, J. C. print and Vergara, S. V. print (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
Publisher's URL: http://www.oldcitypublishing.com/JCA/JCAcontents/J...
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.
Repository Staff Only: item control page
Total Document Downloads in Past 12 Months
Total Document DownloadsMore statistics for this item...