We consider the distributions of the lengths of the longest weakly increasing and
strongly decreasing subsequences in words of length N from an alphabet of k letters. We
find Toeplitz determinant representations for the exponential generating functions (on N)
of these distribution functions and show that they are expressible in terms of solutions of
Painlev