Let A be an n x n matrix with non-negative entries and no entry in (0, 1).
We prove that there exist integers r, s with 0 less than or equal to r less
than or equal to s less than or equal to 2(n) such that A(r) less than or
equal to A(s). We prove that 2(n) cannot be replaced with e root(n log n).
We also give an application to the theory of formal languages. (C) 1999 Pub
lished by Elsevier Science Inc. All rights reserved.