Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton (Q5940983)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton |
scientific article; zbMATH DE number 1635138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton |
scientific article; zbMATH DE number 1635138 |
Statements
Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton (English)
0 references
20 August 2001
0 references
We introduce a new class of two-dimensional Cellular Automata (CAs) whose inter-cell communication is restricted to 1-bit and propose a linear-time connectivity recognition algorithm for two-dimensional binary images. Precisely, it is shown that a set of two-dimensional connected binary images of size \(m\times\)n can be recognized in \(2(m+n)+O(1)\) steps by a two-dimensional CA with 1-bit inter-cell communication.
0 references
two-dimensional cellular automata
0 references
0.7736805081367493
0 references
0.749011754989624
0 references
0.7444180250167847
0 references