@ARTICLE{Martyn_Tomasz_A computer_2024,
 author={Martyn, Tomasz},
 volume={vol. 70},
 number={No 4},
 journal={International Journal of Electronics and Telecommunications},
 pages={1113–1123},
 howpublished={online},
 year={2024},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which actual numerical computation takes place. In this context, we investigate the possibility of the application of the random iteration algorithm to approximate these discrete IFS invariant sets and measures. The problems concerning a discretization of hyperbolic IFSs are considered as special cases of this more general setting.},
 type={article},
 title={A computer scientist’s perspective on approximation of IFS invariant sets and measures with the random iteration algorithm},
 URL={http://czasopisma.pan.pl/Content/133241/PDF-MASTER/41_4838_Martyn_L_sk.pdf},
 doi={10.24425/ijet.2024.152514},
 keywords={IFS, Discrete Space, Markov Chain, Approximation, Invariant Set, Invariant Measure},
}