Voir la notice de l'article provenant de la source Numdam
We prove that the function that maps a word of a rational language onto its successor for the radix order in this language is a finite union of co-sequential functions.
@article{ITA_2010__44_1_19_0,
author = {Angrand, Pierre-Yves and Sakarovitch, Jacques},
title = {Radix enumeration of rational languages},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {19--36},
publisher = {EDP-Sciences},
volume = {44},
number = {1},
year = {2010},
doi = {10.1051/ita/2010003},
mrnumber = {2604933},
zbl = {1186.68243},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2010003/}
}
TY - JOUR AU - Angrand, Pierre-Yves AU - Sakarovitch, Jacques TI - Radix enumeration of rational languages JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2010 SP - 19 EP - 36 VL - 44 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2010003/ DO - 10.1051/ita/2010003 LA - en ID - ITA_2010__44_1_19_0 ER -
%0 Journal Article %A Angrand, Pierre-Yves %A Sakarovitch, Jacques %T Radix enumeration of rational languages %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2010 %P 19-36 %V 44 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2010003/ %R 10.1051/ita/2010003 %G en %F ITA_2010__44_1_19_0
Angrand, Pierre-Yves; Sakarovitch, Jacques. Radix enumeration of rational languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 44 (2010) no. 1, pp. 19-36. doi: 10.1051/ita/2010003
Cité par Sources :