Abstract
A word is non-repetitive if it does not contain a subword of the form vv. Given a list of alphabets L = L1,L2,…,L n , we investigate the question of generating non-repetitive words w = w1w2…w n , such that the symbol w i is a letter in the alphabet L i . This problem has been studied by several authors (e.g., [GKM10], [Sha09]), and it is a natural extension of the original problem posed and solved by A. Thue. While we do not solve the problem in its full generality, we show that such strings exist over many classes of lists. We also suggest techniques for tackling the problem, ranging from online algorithms, to combinatorics over 0-1 matrices, and to proof complexity. Finally, we show some properties of the extension of the problem to abelian squares.
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
Abrahamson, K.R.: Generalized string matching. SIAM J. Comput. 16(6), 1039–1051 (1987)
Berstel, J.: Axel Thue’s papers on repetitions in words: a translation. Technical report, Université du Québec a Montréal (1995)
Cook, S.A., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge Univeristy Press (2010)
Dvořák, Z., Kawarabayashi, K.-I., Thomas, R.: Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms 7(4), 41:1–41:14 (2011)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete graph problems. Theoretical Computer Science 1(3), 237–267 (1976)
Grytczuk, J., Kozik, J., Micek, P.: A new approach to nonrepetitive sequences. arXiv:1103.3809 (December 2010)
Grötzsch, H.: Ein dreifarbensatz für dreikreisfreie netze auf der kugel 8, 109–120 (1959)
Hall, P.: On representatives of subsets. In: Gessel, I., Rota, G.-C. (eds.) Classic Papers in Combinatorics. Modern Birkhäuser Classics, pp. 58–62. Birkhäuser, Basel (1987)
Leech, J.: A problem on strings of beads. Mathematical Gazette, 277 (December 1957)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
Rampersad, N.: Overlap-free words and generalizations. PhD thesis, Waterloo University (2007)
Shallit, J.: A second course in formal languages and automata theory. Cambridge Univeristy Press (2009)
Stanley, R.P.: Exercises on catalan and related numbers. Enumerative Combinatorics 2 (1999)
Smyth, W.F., Wang, S.: An adaptive hybrid pattern-matching algorithm on indeterminate strings. Int. J. Found. Comput. Sci. 20(6), 985–1004 (2009)
Thue, A.: Über unendliche zeichenreichen. Skrifter: Matematisk-Naturvidenskapelig Klasse. Dybwad (1906)
Robinson Tompkins, C.: The morphisms with unstackable image words. CoRR, abs/1006.1273 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mhaskar, N., Soltys, M. (2015). Non-repetitive Strings over Alphabet Lists. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-15612-5_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15611-8
Online ISBN: 978-3-319-15612-5
eBook Packages: Computer ScienceComputer Science (R0)