|
|
| Click each address | to see it highlighted. |
| The empty length 2 addresses are | The empty length 3 addresses are |
| 11 | 111, 112, 113, 114 (contained in 11) |
| 14 | 141, 142, 143, 144 (contained in 14) |
| 41 | 411, 412, 413, 414 (contained in 41) |
| 44 | 441, 442, 443, 444 (contained in 44) |
| 211, 214, 241, 244 | |
| 311, 314, 341, 344 |
| Every empty length 3 address contains an empty length 2 address. |
| So it is possible that forbidden pairs determine all the empty addresses in this driven IFS. |
| Of course, there may be longer empty addresses that do not contain forbidden pairs. |
Return to Combinatorial example.