| Issue |
RAIRO-Theor. Inf. Appl.
Volume 44, Number 1, January-March 2010
Special issue dedicated to the 12th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 19 - 36 | |
| DOI | https://doi.org/10.1051/ita/2010003 | |
| Published online | 11 February 2010 | |
Radix enumeration of rational languages
1
LTCI (UMR 5141), Telecom ParisTech,
46 rue Barrault, 75634 Paris Cedex 13, France;
angrand@enst.fr
2
LTCI (UMR 5141), CNRS / Telecom ParisTech,
46 rue Barrault, 75634 Paris Cedex 13, France;
sakarovitch@enst.fr
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.
Mathematics Subject Classification: 68Q45 / 68Q70.
Key words: Finite automata / rational functions of words / sequential transducers.
© EDP Sciences, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.