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

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2006.03.006 / rank
Normal rank
 
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
Property / cites work
 
Property / cites work: Q3802629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some relations between dynamical systems and transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of dynamical systems and hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability problems for sequential dynamical systems with threshold functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of a theory of simulation. III: Equivalence of SDS. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4031421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of a theory of computer simulation. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On totalistic systolic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Limit Sets of Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversion of 2D cellular automata: Some complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transient length in sequential iteration of threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4854587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving liveness for networks of communicating finite state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of totalistic cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular automata and the sciences of complexity. A review of some outstanding problems in the theory of cellular automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary games and computer simulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of verifying concurrent transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability with low-dimensional dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence relations on finite dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and simulation of sequential dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpredictability and undecidability in dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized shifts: unpredictability and undecidability in dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete, sequential dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous automata versus asynchronous cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic orientations and sequential dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way cellular automata on Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata-models for the investigation of dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3980261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of finite cellular automata / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2006.03.006 / rank
 
Normal rank

Latest revision as of 05:34, 10 December 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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references