One-dimensional cellular automata as arithmetic recursions Article

•  
• Overview
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

abstract

• One-dimensional cellular automata are shown to be equivalent to finite-state mechanes if provided with a class of feedback functions. This result is presented as a class of arithmetic recursions in two integer variables. © 1989.

authors

• Urías Hermosillo Jesús

publication date

• 1989-01-01

funding provided via

• First Aircraft Institute, FAI  Grant
• Secretaría de Educación Pública, SEP  Grant
• Universidad Autónoma de San Luis Potosí, UASLP  Grant

published in

• Physica D: Nonlinear Phenomena  Journal

Identity

Digital Object Identifier (DOI)

• 10.1016/0167-2789(89)90251-0

Additional Document Info

start page

• 109

end page

• 110

volume

• 36

issue

• 1-2