Complexity of reachability problems for finite discrete dynamical systems (Q856411): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
m rollbackEdits.php mass rollback
Tag: Rollback
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2006.03.006 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092522621 / rank
Normal rank
 

Revision as of 19:49, 19 March 2024

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references