  We revisit the problem of resolution of singularities of toric curves by
iterating Nash modification. We give a bound on the number of iterations
required to obtain the resolution. We also introduce a different approach on
counting iterations by dividing the combinatorial algorithm of Nash
modification of toric curves into several division algorithms.
