Attractor and its self-similarities for an IFS over arbitrary sub-shift
Dawoud Ahmadi Dastjerdi, Sedigheh Darsaraee

TL;DR
This paper investigates the self-similarity and attractor properties of iterated function systems (IFS) over arbitrary sub-shifts, extending classical results to more general symbolic dynamics settings.
Contribution
It provides sufficient conditions for self-similarity of attractors in IFS driven by sub-shifts, generalizing Hutchinson's classical results to arbitrary symbolic constraints.
Findings
Established conditions for $H^n(S)=S$ under sub-shift dynamics.
Analyzed the attractor's behavior with respect to different sub-shift constraints.
Extended classical IFS theory to more general symbolic dynamical systems.
Abstract
Consider a compact metric space , and let be a set of contracting and continuous self maps on . Let be a sub-shift on symbols, and let be the full shift. Define as the set of words of length in . For , set and . When , is the th iteration of the Hutchinson's operator, and there exists a compact set for any compact with (self-similarity criteria) for . For arbitrary , the above limit exists; but it is not necessarily true that . Sufficient conditions on are provided to have for all or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Distributed and Parallel Computing Systems · Petri Nets in System Modeling
