Recherche
Voici les éléments 1-10 de 39
Suffix conjugates for a class of morphic subshifts
(Cambridge University Press, 2015-09)
Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and ...
Cubefree words with many squares
(Discrete Mathematics and Theoretical Computer Science, 2014-05-13)
We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.
Combinatorics and Algorithmics of Strings
(Dagstuhl Publishing, 2014-03-09)
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever information is electronically transmitted (as bit streams), when natural language text is spoken or written down (as words ...
Unary patterns under permutations
(Elsevier, 2018-06-04)
Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, ...
Counting endomorphisms of crown-like orders
(Springer, 2002-12)
The authors introduce the notion of crown-like orders and introduce powerful tools for counting the endomorphisms of orders of this type.
Avoidability index for binary patterns with reversal
(2017)
For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable.
The number of order–preserving maps of fences and crowns
(Springer, 1991-06)
We perform an exact enumeration of the order-preserving maps of fences (zig-zags) and crowns (cycles). From this we derive asymptotic results.
The metric dimension and metric independence of a graph
(The Charles Babbage Research Centre, 2001)
A vertex x of a graph G resolves two vertices u and v of G if the
distance from x to u does not equal the distance from x to v. A set
S of vertices of G is a resolving set for G if every two distinct vertices
of G are ...
Binary Words Avoiding xxRx and Strongly Unimodal Sequences
(2015-09-14)
In previous work, Currie and Rampersad showed that the growth of the number
of binary words avoiding the pattern xxxR was intermediate between polynomial and
exponential. We now show that the same result holds for the ...
Avoiding three consecutive blocks of the same size and same sum
(Association of Computing Machinery, 2014-04)
We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from1994.