SOME COMMENTS ON NEIGHBORHOOD SIZE FOR TESSELLATION AUTOMATA

被引:7
作者
AMOROSO, S
GUILFOYLE, R
机构
来源
INFORMATION AND CONTROL | 1972年 / 21卷 / 01期
关键词
D O I
10.1016/S0019-9958(72)90034-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:48 / +
页数:1
相关论文
共 8 条
[1]  
COLE SN, 1966, 7 ANN S SWITCH AUT T, P53
[2]  
GUILFOYLE R, 1971, THESIS STEVENS I TEC
[3]   MACHINE COMPLEXITY VERSUS INTERCONNECTION COMPLEXITY IN ITERATIVE ARRAYS [J].
HAMACHER, VC .
IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (03) :321-&
[4]  
KORSARAJU SR, 1969, THESIS U PENNSYLVANI
[5]   CELLULAR AUTOMATA COMPLEXITY TRADE-OFFS [J].
SMITH, AR .
INFORMATION AND CONTROL, 1971, 18 (05) :466-&
[6]  
WHYBURN GT, 1942, 28 AM MATH SOC COLL
[7]   TESSELLATION AUTOMATA [J].
YAMADA, H ;
AMOROSO, S .
INFORMATION AND CONTROL, 1969, 14 (03) :299-&
[8]   STRUCTURAL AND BEHAVIORAL EQUIVALENCES OF TESSELLATION AUTOMATA [J].
YAMADA, H ;
AMOROSO, S .
INFORMATION AND CONTROL, 1971, 18 (01) :1-&