 |
|
 |
|
|
|
|
|
| HAL : hal-00647052, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
|
|
| Radix enumeration of rational languages is almost co-sequential. |
|
|
| Pierre-Yves Angrand 1Jacques Sakarovitch 1 |
|
|
| (06/06/2008) |
|
|
|
| We define and study here the class of rational functions that are finite union of sequential functions. These functions can be realized by cascades of sequential transducers. After showing that cascades of any height are equivalent to cascades of height at most two and that this class strictly contains sequential functions and is strictly contained in the class of rational functions, we prove the result whose statement gives the paper its title. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Traitement et Communication de l'Information [Paris] (LTCI) |
|
|
|
Télécom ParisTech – CNRS : UMR5141 |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Informatique et langage |
|
|
| finite automata – rational functions of words – sequential transducers |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00647052, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00647052 | |
| oai:hal.archives-ouvertes.fr:hal-00647052 | |
| Contributeur : Pierre-Yves Angrand | |
| Soumis le : Jeudi 1 Décembre 2011, 13:33:43 | |
| Dernière modification le : Jeudi 1 Décembre 2011, 13:36:38 | |
