Computational complexity of finite asynchronous cellular automata (Q517039)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational complexity of finite asynchronous cellular automata
scientific article

    Statements

    Computational complexity of finite asynchronous cellular automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    natural computing
    0 references
    asynchronous cellular automata
    0 references
    computational complexity
    0 references
    0 references
    0 references