We provide various algorithms for determinization of fuzzy automata over complete residuated lattices: construction of the Nerode automataon, determinization by means of right invariant fuzzy quasi-orders, construction of the children automaton, determinization by means of closures, and Brzozowski’s type determinization.  We compare them with respect to the size of the automaton that they produce and their computational time. We transfer some of these algorithms to weighted automata over semirings  and strong bimonoids.