Results 1 to 10 of about 49 (49)
Anti-power $j$-fixes of the Thue-Morse word [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Recently, Fici, Restivo, Silva, and Zamboni introduced the notion of a $k$-anti-power, which is defined as a word of the form $w^{(1)} w^{(2)} \cdots w^{(k)}$, where $w^{(1)}, w^{(2)}, \ldots, w^{(k)}$ are distinct words of the same length.
Marisa Gaetz
doaj +1 more source
Binary patterns in the Prouhet-Thue-Morse sequence [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We show that, with the exception of the words $a^2ba^2$ and $b^2ab^2$, all (finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence can actually be found in that sequence as segments (up to exchange of letters in the infinite case).
Jorge Almeida, Ondřej Klíma
doaj +1 more source
Complementary symmetric Rote sequences: the critical exponent and the recurrence function [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the corresponding standard ...
Lubomíra Dvořáková +2 more
doaj +1 more source
Automatic sequences: from rational bases to trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system.
Michel Rigo, Manon Stipulanti
doaj +1 more source
The repetition threshold for binary rich words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\sqrt{2}/2$ ($\approx 2.707$
James D. Currie +2 more
doaj +1 more source
Constructions of words rich in palindromes and pseudopalindromes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A narrow connection between infinite binary words rich in classical palindromes and infinite binary words rich simultaneously in palindromes and pseudopalindromes (the so-called $H$-rich words) is demonstrated.
Edita Pelantová, Štěpán Starosta
doaj +1 more source
Permutation complexity of images of Sturmian words by marked morphisms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.
Adam Borchert, Narad Rampersad
doaj +1 more source
Nonrepetitive edge-colorings of trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is repetition-free or nonrepetitive if there is no path with a color pattern that is a repetition.
A. Kündgen, T. Talbot
doaj +1 more source
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of consecutive ...
Ioannis Michos, Christina Savvidou
doaj +1 more source
String attractors of Rote sequences [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper, we describe minimal string attractors (of size two) of pseudopalindromic prefixes of standard complementary-symmetric Rote sequences. Such a class of Rote sequences forms a subclass of binary generalized pseudostandard sequences, i.e., of ...
Lubomíra Dvořáková +1 more
doaj +1 more source