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

DOI10.1016/J.CHAOS.2005.08.170zbMATH Open1220.28002OpenAlexW2038380711MaRDI QIDQ936740FDOQ936740

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

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

Mathematics Subject Classification ID

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

Cites Work

• Finding Groups in Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Bootstrapping complex functions

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)