703 research outputs found
Constructions of words rich in palindromes and pseudopalindromes
A narrow connection between infinite binary words rich in classical
palindromes and infinite binary words rich simultaneously in palindromes and
pseudopalindromes (the so-called -rich words) is demonstrated.
The correspondence between rich and -rich words is based on the operation
acting over words over the alphabet and defined by
, where .
The operation enables us to construct a new class of rich words and a new
class of -rich words.
Finally, the operation is considered on the multiliteral alphabet
as well and applied to the generalized Thue--Morse words. As a
byproduct, new binary rich and -rich words are obtained by application of
on the generalized Thue--Morse words over the alphabet .Comment: 26 page
Factor frequencies in generalized Thue-Morse words
We describe factor frequencies of the generalized Thue-Morse word t_{b,m}
defined for integers b greater than 1, m greater than 0 as the fixed point
starting in 0 of the morphism \phi_{b,m} given by
\phi_{b,m}(k)=k(k+1)...(k+b-1), where k = 0,1,..., m-1 and where the letters
are expressed modulo m. We use the result of A. Frid, On the frequency of
factors in a D0L word, Journal of Automata, Languages and Combinatorics 3
(1998), 29-41 and the study of generalized Thue-Morse words by S. Starosta,
Generalized Thue-Morse words and palindromic richness, arXiv:1104.2476v2
[math.CO].Comment: 11 page
On the critical exponent of generalized Thue-Morse words
For certain generalized Thue-Morse words t, we compute the "critical
exponent", i.e., the supremum of the set of rational numbers that are exponents
of powers in t, and determine exactly the occurrences of powers realizing it.Comment: 13 pages; to appear in Discrete Mathematics and Theoretical Computer
Science (accepted October 15, 2007
On the critical exponent of generalized Thue-Morse words
Automata, Logic and Semantic
On winning shifts of marked uniform substitutions
The second author introduced with I. T\"orm\"a a two-player word-building
game [Playing with Subshifts, Fund. Inform. 132 (2014), 131--152]. The game has
a predetermined (possibly finite) choice sequence , ,
of integers such that on round the player chooses a subset
of size of some fixed finite alphabet and the player picks
a letter from the set . The outcome is determined by whether the word
obtained by concatenating the letters picked lies in a prescribed target
set (a win for player ) or not (a win for player ). Typically, we
consider to be a subshift. The winning shift of a subshift is
defined as the set of choice sequences for which has a winning strategy
when the target set is the language of . The winning shift mirrors
some properties of . For instance, and have the same entropy.
Virtually nothing is known about the structure of the winning shifts of
subshifts common in combinatorics on words. In this paper, we study the winning
shifts of subshifts generated by marked uniform substitutions, and show that
these winning shifts, viewed as subshifts, also have a substitutive structure.
Particularly, we give an explicit description of the winning shift for the
generalized Thue-Morse substitutions. It is known that and have the
same factor complexity. As an example application, we exploit this connection
to give a simple derivation of the first difference and factor complexity
functions of subshifts generated by marked substitutions. We describe these
functions in particular detail for the generalized Thue-Morse substitutions.Comment: Extended version of a paper presented at RuFiDiM I
Generalized Thue-Morse words and palindromic richness
We prove that the generalized Thue-Morse word defined for
and as , where denotes the sum of digits in the base-
representation of the integer , has its language closed under all elements
of a group isomorphic to the dihedral group of order consisting of
morphisms and antimorphisms. Considering simultaneously antimorphisms , we show that is saturated by -palindromes
up to the highest possible level. Using the terminology generalizing the notion
of palindromic richness for more antimorphisms recently introduced by the
author and E. Pelantov\'a, we show that is -rich. We
also calculate the factor complexity of .Comment: 11 page
- …