Schützenberger and Eilenberg theorems for words on linear orderings

  • Authors:

  • Nicolas Bedon;Chloé Rispal

  • Affiliations:

  • Institut Gaspard Monge, Université Paris-Est Marne-la-Vallée and CNRS, 5, boulevard Descartes, Champs-sur-Marne, 77454 Marne-la-Vallée Cedex 2, France;Institut Gaspard Monge, Université Paris-Est Marne-la-Vallée and CNRS, 5, boulevard Descartes, Champs-sur-Marne, 77454 Marne-la-Vallée Cedex 2, France

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper contains extensions to words on countable scattered linear orderings of two well-known results of characterization of languages of finite words. We first extend a theorem of Schutzenberger establishing that the star-free sets of finite words are exactly the languages recognized by finite aperiodic semigroups. This gives an algebraic characterization of star-free sets of words over countable scattered linear orderings. Contrarily to the case of finite words, first-order definable languages are strictly included into the star-free languages when countable scattered linear orderings are considered. Second, we extend the variety theorem of Eilenberg for finite words: there is a one-to-one correspondence between varieties of languages of words on countable scattered linear orderings and pseudo-varieties of algebras. The star-free sets are an example of such a variety of languages.