Star-free sets of words on ordinals
This material has been published in Information and Computation, number 166, 2001, pp 93-111, the only definitive repository of the content that has been certified and accepted after peer review. Copyright and all rights therein are retained by Academic Press. This material may not be copied or reposted without explicit permission. IDEAL
Let n be a fixed integer; we extend the theorem of Schützenberger, McNaughton and Papert on star-free sets of finite words to languages of sequences of length less than ω^n.
Gzipped postscript file (136 Ko)