Computational complexity of dynamical systems: the case of cellular automata (Q948080): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3135846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of complexity for continuous time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines, Computations, and Universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subshift attractors of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of linear automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endomorphisms and automorphisms of the shift dynamical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attractors in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages, equicontinuity and attractors in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the measure attractor of a cellular automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-dimensional dynamical systems, formal languages, and universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Computation-Universal Cellular Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subshifts of finite type and sofic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675526 / rank
 
Normal rank

Revision as of 17:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of dynamical systems: the case of cellular automata
scientific article

    Statements

    Computational complexity of dynamical systems: the case of cellular automata (English)
    0 references
    8 October 2008
    0 references
    cellular automata
    0 references
    universality
    0 references
    classification
    0 references
    0 references
    0 references

    Identifiers