×

Radix enumeration of rational languages. (English) Zbl 1186.68243

Summary: 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.

MSC:

68Q45 Formal languages and automata
68Q70 Algebraic theory of languages and automata
PDFBibTeX XMLCite
Full Text: DOI EuDML Link

References:

[1] P.-Y. Angrand, J. Sakarovitch and R. de Souza, Sequential transducer cascades. In preparation.
[2] J. Berstel, Transductions and Context-Free Languages. Teubner (1979). · Zbl 0424.68040
[3] V. Berthé, Ch. Frougny, M. Rigo and J. Sakarovitch, On the cost and complexity of the successor function, in Proc. WORDS 2007, edited by P. Arnoux, N. Bédaride and J. Cassaigne, Tech. Rep., Institut de mathématiques de Luminy (Marseille) (2007) 43-56.
[4] V. Berthé, Ch. Frougny, M. Rigo and J. Sakarovitch, On the concrete complexity of the successor function. In preparation.
[5] Ch. Choffrut, Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theoret. Comput. Sci.5 (1977) 325-337. Zbl0376.94022 · Zbl 0376.94022 · doi:10.1016/0304-3975(77)90049-4
[6] Ch. Choffrut and M.P. Schützenberger, Décomposition de fonctions rationnelles, Proc. STACS’86 , edited by B. Monien, G. Vidal-Naquet. Lect. Notes Comput. Sci.210 (1986) 213-226. · Zbl 0605.68071
[7] S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press (1974). · Zbl 0317.94045
[8] P. Lecomte and M. Rigo, Numeration systems on a regular language. Theor. Comput. Syst.34 (2001) 27-44. Zbl0969.68095 · Zbl 0969.68095 · doi:10.1007/s002240010014
[9] D. Perrin, Finite automata. Handbook of Theoretical Computer Science Vol. B, edited by J. van Leeuwen. Elsevier (1990) 1-53.
[10] Ch. Reutenauer, Une caractérisation de la finitude de l’ensemble des coefficients d’une série rationnelle en plusieurs variables non commutatives. C. R. Acad. Sci. Paris284 (1977) 1159-1162. Zbl0357.94024 · Zbl 0357.94024
[11] J. Sakarovitch, Deux remarques sur un théorème de S. Eilenberg. RAIRO-Theor. Inf. Appl.17 (1983) 23-48. · Zbl 0512.68063
[12] J. Sakarovitch, Eléments de théorie des automates. Vuibert (2003). English corrected edition: Elements of Automata Theory, Cambridge University Press (2009).
[13] M.P. Schützenberger, Sur une variante des fonctions séquentielles. Theoret. Comput. Sci.4 (1977) 47-57.
[14] J. Shallit, Numeration systems, linear recurrences, and regular sets. Inform. Comput. 113 (1994) 331-347. · Zbl 0810.11006 · doi:10.1006/inco.1994.1076
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.