  We propose a slight modification of the Berlekamp-Massey Algorithm for
obtaining the minimal polynomial of a given linearly recurrent sequence. Such a
modification enables to explain it in a simpler way and to adapt it to lazy
evaluation.
