Summary
We consider bi-infinite k-automatic sequences, i.e., maps \(f:\mathbb{Z} \to \mathcal{R}\) with values in a finite ring \(\mathcal{R}\). We study the dependence of the number of kernel elements on the particular choice of a k-residue set. We establish several upper estimates for the number of kernel elements, in particular, for decimation invariant- and periodic sequences.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.-P. Allouche. Automates finis en théorie des nombres, Expo. Math 5(1987), 239–266.
J-P Allouche, E Cateland, WJ Gilbert, H-O Peitgen, JO Shallit, G Skordev Automatic maps in exotic numeration systems Theory Comput. Systems 30(1997), 285–331.
J-P Allouche, J Shallit The Ubiquitous Prouhet-Thue-Morse sequence in “Sequences and their Applications” (C Ding, T Helleseth, H Niederreiter, eds.), Springer-Verlag London 1999 1–16.
A. Barbé, G. Skordev. Decimation-invariant sequences and their automaticity, Theoret. Comput. Sci. (to appear).
A. Barbé, F. von Haeseler. Symmetries of decimation invariant sequences and digit sets, Theoret. Comput. Sci. (to appear).
G. Christol, T. Kamae, M. Mendès France, G. Rauzy. Suites algébriques, automates et substitutions, Bull. Soc. Math. France 108(1980), 401–419.
A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata, Math. Systems Theory 3(1969), 186–192.
F. von Haeseler. On algebraic properties of sequences generated by substitutions over a group, Habilitationsschrift, Universität Bremen, 1996.
F. von Haeseler, W Jürgensen Automaticity of Solutions of Mahler equations in Sequences and their Applications C Ding, T Helleseth and H Niederreiter (eds), Springer-Verlag London 1999.
W. Jürgensen Automaticity of solutions of Mahler equations PhD Thesis, Universität Bremen, 2000.
O. Salon Suites automatiques a multi-indices Séminaire de Théorie des nombres Bordeaux Exp. 4 (1986–1987), 4–01 – 4–27.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this paper
Cite this paper
Barbé, A., von Haeseler, F. (2002). On the Number of Kernel Elements of Automatic Sequences. In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0673-9_8
Publisher Name: Springer, London
Print ISBN: 978-1-85233-529-8
Online ISBN: 978-1-4471-0673-9
eBook Packages: Springer Book Archive