Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton (Q5940983)

From MaRDI portal
Revision as of 21:53, 21 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1635138
Language Label Description Also known as
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
    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

    Identifiers