The shuffle product: New research directions
A Restivo - International Conference on Language and Automata …, 2015 - Springer
The Shuffle Product: New Research Directions Page 1 The Shuffle Product: New Research
Directions Antonio Restivo(B) Dipartimento di Matematica e Informatica, Universit`a di …
Directions Antonio Restivo(B) Dipartimento di Matematica e Informatica, Universit`a di …
[图书][B] Avoiding and enforcing repetitive structures in words
M Müller - 2014 - books.google.com
Avoiding and enforcing repetitions in words are central topics in the area of combinatorics
on words, with first results going back to the beginning of the 20th century. The results …
on words, with first results going back to the beginning of the 20th century. The results …
On the Self Shuffle Language
P Fleischmann, T Harju, L Haschke, J Höfer… - arXiv preprint arXiv …, 2022 - arxiv.org
The shuffle product\(u\shuffle v\) of two words\(u\) and\(v\) is the set of all words which can be
obtained by interleaving\(u\) and\(v\). Motivated by the paper\emph {The Shuffle Product …
obtained by interleaving\(u\) and\(v\). Motivated by the paper\emph {The Shuffle Product …
On shuffling of infinite square-free words
M Müller, S Puzynina, M Rao - The Electronic Journal of …, 2015 - combinatorics.org
In this paper we answer two recent questions from Charlier et al.(2014) and Harju (2013)
about self-shuffling words. An infinite word $ w $ is called self-shuffling, if $ w=\prod_ {i …
about self-shuffling words. An infinite word $ w $ is called self-shuffling, if $ w=\prod_ {i …
Infinite square-free self-shuffling words
M Müller, S Puzynina, M Rao - arXiv preprint arXiv:1401.6536, 2014 - arxiv.org
In this paper we answer two recent questions from Charlier et al. and Harju about self-
shuffling words. An infinite word $ w $ is called self-shuffling, if $ w=\prod_ {i= 0}^\infty …
shuffling words. An infinite word $ w $ is called self-shuffling, if $ w=\prod_ {i= 0}^\infty …