I think this can be done by finding the $kth$ power of the adjacency matrix of the DFA. The entry in $ith$ row and $jth$ column of this matrix will represent the number of paths of length $k$ from node $i$ to node $j$. Can someone confirm if this is correct?