Abstract
The main result is a characterization of enumerative sequences of regular languages on k symbols. We prove that a sequence is the generating series s(z) of a regular language on k symbols if and only if it is the generating series of a language over a k-letter alphabet and if both series s(z) and (kz)*–s(z) are regular. The proof uses transformations on linear representations called inductions.
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
Salomaa, A., Soittola, M.: Automata Theoretic Properties of Formal Power Series. Springer-Verlag (1978)
Bassino, F., Béal, M.P., Perrin, D.: Super-state automata and rational trees. In Lucchesi, C.L., Moura, A.V., eds.: LATIN’98. Number 1380 in Lecture Notes in Computer Science, Springer-Verlag (1998) 42–52
Bassino, F., Béal, M.P., Perrin, D.: A finite state version of the Kraft-McMillan theorem. SIAM J. Comput. 30 (2000) 1211–1230
Lind, D.A.: Entropies and factorizations of topological Markov shifts. Bull. Amer. Math. Soc. (1983) 219–222
Lind, D.A.: The entropies of topological Markov shifts and their related class of algebraic integers. Ergod. Th. & Dynam. Sys. (1984) 283–300
Lind, D.A., Marcus, B.H.: An Introduction to Symbolic Dynamics and Coding. Cambridge (1995)
Gantmacher, F.R.: Matrix Theory, Volume I. Chelsea Publishing Company, New York (1977)
MacCluer, C.R.: The many proofs and applications of Perron’s theorem. SIAM Rev. 42 (2000) 487–498
Berstel, J., Reutenauer, Ch.: Rational Series and their Languages. Springer-Verlag (1988)
Bassino, F., Béal, M.P., Perrin, D.: Length distribution and regular sequences. In Rosenthal, J., Marcus, B., eds.: Codes, Systems and Graphical Models. Volume 123 of IMA Volumes in Mathematics and its Applications., Springer-Verlag (2001) 415–437
Bassino, F., Béal, M.P., Perrin, D.: Enumerative sequences of leaves in rational trees. In: ICALP’97. Number 1256 in Lecture Notes in Computer Science, Springer-Verlag (1997) 76–86
Bassino, F., Béal, M.P., Perrin, D.: Enumerative sequences of leaves and nodes in rational trees. Theoret. Comput. Sci. (1999) 41–60
Eilenberg, S.: Automata, Languages and Machines. Volume A. Academic Press (1974)
Kitchens, B.P.: Symbolic Dynamics: one-sided, two-sided and countable state Markov shifts. Springer-Verlag (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marie-Pierre, B., Perrin, D. (2002). On the Enumerative Sequences of Regular Languages on k Symbols. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_45
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive