Abstract
In [1], partial words were defined to be partial mappings of a set {1,..., n} to a finite alphabet. We continue the research of periodic partial words started in that paper. The main goal is to clarify the interaction of different periods of a word. In particular, we exhibit some propeties of periodic partial words, which are quite similar to classical Theorem of Fine and Wilf.
Supported by the INTAS grant no.99-1224
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
J. Berstel, L. Boasson, Partial words and a theorem of Fine and Wilf, Theor. Comp. Sci., 218 (1999), 135–141.
N. J. Fine, H. S. Wilf, Uniqueness theorem for periodic functions, Proc. Amer. Math. Soc., 16 (1965), 109–114.
C. Choffrut, J. Karhumäki, Combinatorics on words, in: G. Rosenberg, A. Salomaa (Eds.), Handbook of formal languages, v. 1, Ch.6, Springer, Berlin, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shur, A.M., Konovalova, Y.V. (2001). On the Periods of Partial Words. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_57
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive