共 50 条
COMPLEXITY OF IDENTIFYING ASYNCHRONOUS NONSTATIONARY CELLULAR-AUTOMATA
被引:0
|作者:
ADAMATSKIY, AI
[1
]
机构:
[1] ST PETERSBURG STATE UNIV,ST PETERSBURG,RUSSIA
关键词:
D O I:
暂无
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
The present article is devoted to a discussion of deterministic finite-state asynchronous nonstationary multidimensional cellular automata. Sequential and parallel algorithms for establishing the rules of local transitions of cells along a stipulated sequence of configurations of a cellular automaton are proposed. Upper bounds on the space and time complexity of identification we calculated. The effectiveness of parallel algorithms is estimated.
引用
收藏
页码:127 / 130
页数:4
相关论文