| HAL : hal-00113768, version 1 |
| Fiche détaillée | Récupérer au format |
|
|
| (1998) |
|
|
|
|
| Positive varieties and infinite words |
|
|
| Jean-Eric Pin 1 |
|
|
| (1998) |
|
|
| Carrying on the work of Arnold, Pécuchet and Perrin, Wilke has obtained a counterpart of Eilenberg's variety theorem for finite and infinite words. In this paper, we extend this theory for classes of languages that are closed under union and intersection, but not necessarily under complement. As an example, we give a purely algebraic haracterization of various classes of recognizable sets defined by topological properties (open, closed, F? and G?) or by combinatorial properties. |
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
| CNRS : UMR7089 – Université Paris VII - Paris Diderot | |
|
|
|
|
|
|
|
|
| Automates et applications |
|
|
|
|
| Domaine | : | Informatique/Autre Mathématiques/Théorie des groupes Informatique/Mathématique discrète |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00113768, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00113768 | |
| oai:hal.archives-ouvertes.fr:hal-00113768 | |
| Contributeur : Jean-Eric Pin | |
| Soumis le : Mardi 14 Novembre 2006, 13:44:34 | |
| Dernière modification le : Mardi 14 Novembre 2006, 13:49:23 | |