Languages recognized by finite supersoluble groups - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2007

Languages recognized by finite supersoluble groups

Résumé

In this paper, we give two descriptions of the languages recognized by finite supersoluble groups. We first show that such a language belongs to the Boolean algebra generated by the modular products of elementary commutative languages. An elementary commutative language is defined by a condition specifying the number of occurrences of each letter in its words, modulo some fixed integer. Our second characterization makes use of counting functions computed by transducers in strict triangular form.
Fichier principal
Vignette du fichier
Supersoluble.pdf (153.62 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00143945 , version 1 (28-04-2007)

Identifiants

  • HAL Id : hal-00143945 , version 1

Citer

Olivier Carton, Jean-Eric Pin, Xaro Soler-Escrivà. Languages recognized by finite supersoluble groups. 2007. ⟨hal-00143945⟩
70 Consultations
57 Téléchargements

Partager

More