Abstract

AbstractWe examine iterated function systems consisting of a countably infinite number of contracting mappings (IIFS). We state results analogous to the well‐known case of finitely many mappings (IFS). Moreover, we show that IIFS can be approximated by appropriately chosen IFS both in terms of Hausdorff distance and of Hausdorff dimension. Comparing the descriptive power of IFS and IIFS as mechanisms defining closed and bounded sets, we show that IIFS are strictly more powerful than IFS. On the other hand, there are closed and bounded non‐empty sets not describable by IIFS.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.