Linear Time Algorithm for Identifying the Invertibility of Null-Boundary Three Neighborhood Cellular Automata

被引：13

作者：

Maiti, Nirmalya S. ^{[1
]}

Ghosh, Soumyabrata ^{[1
]}

Munshi, Shiladitya ^{[1
]}

Chaudhuri, P. Pal ^{[1
]}

机构：

[1] Alumnus Software Ltd, Cellular Automata Res Lab, Sector V, Kolkata 700091, W Bengal, India

来源：

COMPLEX SYSTEMS | 2010年 / 19卷 / 01期

关键词：

D O I：

10.25088/ComplexSystems.19.1.89

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper reports an algorithm to check for the invertibility of null-boundary three neighborhood cellular automata (CAs). While the best known result for checking invertibility is quadratic [1, 2], the complexity of the proposed algorithm is linear. An efficient data structure called a rule vector graph (RVG) is proposed to represent the global functionality of a cellular automaton (CA) by its rule vector (RV). The RVG of a null-boundary invertible CA preserves the specific characteristics that can be checked in linear time. These results are shown in the more general case of hybrid CAs. This paper also lists the elementary rules [3] that are invertible.

引用

页码：89 / 113

页数：25

共 50 条

[41] RTWPCAMARM: A Dynamic Real Time Weather Prediction System with 8 Neighborhood Hybrid Cellular Automata and Modified Association Rule Mining
Sree, Pokkuluri Kiran
Devi, S. S. S. N. Usha N.
2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2015, : 199 - 202
[42] The Algorithm of Area Optimization by Layers and Binary Classification with Use of Three State 2D Cellular Automata
Szaban, Miroslaw
Wawrzynczak, Anna
2018 INTERNATIONAL CONFERENCE ON CONTROL, ARTIFICIAL INTELLIGENCE, ROBOTICS & OPTIMIZATION (ICCAIRO), 2018, : 283 - 288
[43] A linear-time constant-space algorithm for the boundary fill problem
Yanovsky, Vladimir M.
Wagner, Israel A.
Bruckstein, Alfred M.
COMPUTER JOURNAL, 2007, 50 (04): : 473 - 477
[44] A linear-time constant-space algorithm for the boundary fill problem
Yanovsky, Vladimir M.
Wagner, Israel A.
Bruckstein, Alfred M.
Computer Journal, 2007, 50 (04): : 473 - 477
[45] A linear time algorithm for scheduling outforests with communication delays on three processors
Dell'Amico, M
Finta, L
JOURNAL OF ALGORITHMS, 2002, 44 (02) : 287 - 307
[46] A log-linear time algorithm for the elastodynamic boundary integral equation method
Sato, Dye S. K.
Ando, Ryosuke
ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2021, 133 : 407 - 450
[47] A Hierarchical ST-DBSCAN with Three Neighborhood Boundary Clustering Algorithm for Clustering Spatio-temporal Data
Rus, Amalia Mabrina Masbar
Othman, Zulaiha Ali
Abu Bakar, Azuraliza
Zainudin, Suhaila
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2022, 13 (12) : 614 - 626
[48] A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
Kobayashi, Naoki
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, 2011, 6604 : 260 - 274
[49] Testing the Algorithm of Area Optimization by Binary Classification with Use of Three State 2D Cellular Automata in Layers
Szaban, Miroslaw
Wawrzynczak, Anna
PROCEEDINGS OF THE 2018 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2018, : 81 - 84
[50] Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
Terrier, Veronique
CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015, 2015, 9099 : 251 - 262

← 1 2 3 4 5 →