Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox (Q509196): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1016/j.chaos.2015.10.036 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.CHAOS.2015.10.036 / rank
 
Normal rank

Revision as of 03:08, 9 December 2024

scientific article
Language Label Description Also known as
English
Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox
scientific article

    Statements

    Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox (English)
    0 references
    0 references
    9 February 2017
    0 references
    topological entropy
    0 references
    kneading sequences
    0 references
    chaos
    0 references
    Parrondo's paradox
    0 references

    Identifiers