ADDITIVE CELLULAR-AUTOMATA AND ALGEBRAIC SERIES

被引：7
|
作者：
LITOW, B
DUMAS, P
机构：
[1] UNIV WISCONSIN,DIV COMP SERV,MILWAUKEE,WI 53201
[2] INRIA ROCQUENCOURT,ALGORITHMS PROJECT,F-78153 LE CHESNAY,FRANCE
来源：
THEORETICAL COMPUTER SCIENCE | 1993年 / 119卷 / 02期
关键词：
D O I：
10.1016/0304-3975(93)90165-P
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A cellular automaton is an array of regularly interconnected identical cells. We study here the special case of automata where each cell depends in additive manner on its neighbours. The successive states of a given cell form a sequence whose generating series is proved to be always an algebraic series. We also exemplify the realization of a given algebraic series by means of an automaton. As a by-product we obtain a relation between additive cellular automata and certain ''automatic sequences'' like the paper-folding sequence.
引用
收藏
页码：345 / 354
页数：10
相关论文
共 50 条
12345