Complexity of reachability problems for finite discrete dynamical systems (Q856411)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of reachability problems for finite discrete dynamical systems
scientific article

    Statements

    Complexity of reachability problems for finite discrete dynamical systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    finite discrete dynamical systems
    0 references
    complexity classes
    0 references
    discrete Hopfield networks
    0 references
    cellular automata
    0 references
    concurrent transition systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references