Conference
Non-repetitive Strings over Alphabet Lists
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,…,Ln, we investigate the question of generating non-repetitive words w = w1w2…wn, such that the symbol wi is a letter in the alphabet Li. 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 …
Authors
Mhaskar N; Soltys M
Series
Lecture Notes in Computer Science
Volume
8973
Pagination
pp. 270-281
Publisher
Springer Nature
Publication Date
2015
DOI
10.1007/978-3-319-15612-5_24
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743