We show that the set of lexicographically minimal strings of each length in
a matrix language is not necessarily a matrix language. This partially sol
ves a problem formulated by J. Berstel during the Fourth DLT Conference, Aa
chen, 1999. We also briefly discuss the case of simple matrix languages. (C
) 1999 Published by Elsevier Science B.V. All rights reserved.