  We consider dynamical systems arising from substitutions over a finite
alphabet. We prove that such a system is linearly repetitive if and only if it
is minimal. Based on this characterization we extend various results from
primitive substitutions to minimal substitutions. This includes applications to
random Schr\"odinger operators and to number theory.
