Identifying elementary iterated systems through algorithmic inference: the Cantor set example

DOI10.1016/J.CHAOS.2005.08.170MaRDI QIDQ936740zbMATHOpenAlexFDO

Authors B. Apolloni, Simone Bassis

Publication date 19 August 2008

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.chaos.2005.08.170

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Fractals (28A80)

Recommendations

• scientific article; zbMATH DE number 4175305
• Parametric iterative function system for the continuum growth: Cantor set case
• scientific article; zbMATH DE number 2142556
• Random sequences in generalized Cantor sets
• Self-similar structure on intersections of triadic Cantor sets

Cites work

• scientific article; zbMATH DE number 3964277 (Why is no real title available?)
• scientific article; zbMATH DE number 46366 (Why is no real title available?)
• scientific article; zbMATH DE number 47179 (Why is no real title available?)
• scientific article; zbMATH DE number 3514749 (Why is no real title available?)
• scientific article; zbMATH DE number 3551675 (Why is no real title available?)
• scientific article; zbMATH DE number 480659 (Why is no real title available?)
• scientific article; zbMATH DE number 3794378 (Why is no real title available?)
• scientific article; zbMATH DE number 233966 (Why is no real title available?)
• Finding Groups in Data

Cited in

(1)

• Bootstrapping complex functions

Describes a project that uses

Uses Software

• clusfind

This page was built for publication: Identifying elementary iterated systems through algorithmic inference: the Cantor set example

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q936740)