Abstract
We prove that the radix cross-section of a rational set for a length morphism, and more generally for a rational function from a free monoid into ℕ, is rational. This property no longer holds if the image of the function is a subset of a free monoid with two or more generators.
The proof is based on several results on finite automata, such as the lexicographic selection of synchronous relations and the iterative decomposition of unary rational series with coefficients in the tropical semiring. It also makes use of a structural construction on weighted transducers that we call the length difference unfolding.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angrand, P.-Y., Sakarovitch, J.: Radix enumeration of rational languages. RAIRO Theor. Informatics and Appl. (to appear)
Berstel, J., Reutenauer, C.: Les séries rationnelles et leurs langages, Masson (1984); English translation: Rational Series and Their Languages. Springer, Heidelberg (1988)
Berthé, V., Frougny, C., Rigo, M., Sakarovitch, J.: On the cost and complexity of the successor function. In: Arnoux, P., Bédaride, N., Cassaigne, J. (eds.) Proc. of WORDS 2007, CIRM, Luminy, Marseille (2007)
Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, London (1974)
Eilenberg, S., Elgot, C.C., Shepherdson, J.C.: Sets recognized by n-tape automata. J. Algebra 13, 447–464 (1969)
Frougny, C., Sakarovitch, J.: Synchronized relations of finite and infinite words. Theoret. Comp. Sci. 108, 45–82 (1993)
Gaubert, S.: Rational series over dioids and discrete event systems. In: Proc. of the 11th Conf. on Anal. and Opt. of Systems: Discrete Event Systems. LNCIS, vol. 199. Springer, Heidelberg (1994)
Johnson, H.J.: Rational equivalence relations. Theoret. Computer Sci. 47, 39–60 (1986)
Lombardy, S.: Sequentialization and unambiguity of (max,+) rational series over one letter. In: Gaubert, S., Loiseau, J.-J. (eds.) Proc. of a Workshop on Max-Plus Algebras. IFAC. Elsevier, Amsterdam (2001)
Lombardy, S.: Approche structurelle de quelques problèmes de la théorie des automates. Thèse Doctorat Informatique ENST, Paris (2001)
Lombardy, S., Sakarovitch, J.: Sequential? Theoret. Computer Sci. 356, 224–244 (2006)
Sakarovitch, J.: Deux remarques sur un théorème de S. Eilenberg. RAIRO Theor. Informatics and Appl. 17, 23–48 (1983)
Sakarovitch, J.: Éléments de théorie des automates. Vuibert (2003); Corrected English edition: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Shallit, J.: Numeration systems, linear recurrences, and regular sets. Inform. and Comput. 113, 331–347 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lombardy, S., Sakarovitch, J. (2010). Radix Cross-Sections for Length Morphisms. In: López-Ortiz, A. (eds) LATIN 2010: Theoretical Informatics. LATIN 2010. Lecture Notes in Computer Science, vol 6034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12200-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-12200-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12199-9
Online ISBN: 978-3-642-12200-2
eBook Packages: Computer ScienceComputer Science (R0)