2 Jan
2012
2 Jan
'12
11:40 p.m.
* Dan Asimov <dasimov@earthlink.net> [Jan 03. 2012 07:10]:
[...]
For uniqueness I'd should check non-adjacent forms (no two adjacent digits nonzero), e.g., digits 0,+1,-1 in binary.
I may have been to fast here: at least when using digits +1 and +i and radix (-1+i) you get http://www.jjj.de/tmp-rd/rd-naf-m1p1-d1.png where the boundaries of the underlying IFS meet (as will (mod my error) always be the case for the regions of the digit zero and the digit(s) nearest to it). No idea for your question regarding greedy selection apart from the obvious: whenever there are two representations as in 1.0 (terminating) and 0.999... (infinitely many nines (=radix at place minus 1) then greedy gives the terminating representation.