The beautiful Beraha-Kahane-Weiss theorem has found many applications within graph theory, allowing for the determination of the limits of root of graph polynomials in settings as vast as chromatic polynomials, network reliability, and generating polynomials related to independence and domination. Here we extend the class of functions to which the BKW theorem can be applied, and provide some applications in combinatorics.