Search results
- 566 bytes (90 words) - 12:12, 14 February 2020
- 890 bytes (127 words) - 18:42, 11 April 2023
- 2 KB (322 words) - 22:12, 5 June 2020
- are similitudes, then the attractor is called a self-similar set. These sets are usually fractals (cf. [[Fractals|Fractals]]); an exampl A generalization is the concept of a recurrent self-similar (or mixed self-similar) set generated by a recurrent iterated function system. Let $ M = ( m _ {5 KB (810 words) - 22:13, 5 June 2020
- 5 KB (708 words) - 11:11, 17 December 2019
- 4 KB (588 words) - 10:58, 29 May 2020
- 888 bytes (134 words) - 17:45, 4 June 2020
- 3 KB (507 words) - 16:59, 25 November 2023
- 1 KB (167 words) - 17:09, 8 January 2021
- 1 KB (181 words) - 18:51, 24 March 2012
- 937 bytes (157 words) - 10:01, 20 September 2014
- 1,011 bytes (141 words) - 10:59, 29 May 2020
- 10 KB (1,521 words) - 19:59, 4 January 2024
- 1 KB (169 words) - 16:58, 7 February 2011
- 3 KB (485 words) - 19:43, 5 June 2020
- 1,005 bytes (162 words) - 14:23, 30 July 2014
- 4 KB (537 words) - 19:29, 19 December 2015
- 4 KB (527 words) - 09:11, 26 March 2023
- 941 bytes (170 words) - 11:48, 19 November 2018
- 1 KB (198 words) - 05:56, 15 April 2023