Searching for "Palindrome complexity." – sorted by Relevance.
-
Palindrome Complexity Bounds For Primitive Substitution Sequences
- PALINDROME COMPLEXITY BOUNDS FOR PRIMITIVE SUBSTITUTION SEQUENCES DAVID DAMANIK 1;2 AND DOUGLAS
- Add To MetaCart
-
Palindromic complexity of infinite words associated with simple Parry numbers, Ann. Inst. Fourier
- Palindromic complexity of infinite words associated with simple Parry numbers Petr Ambroˇz (1
- Cited by 3 (3 self) – Add To MetaCart
-
New games related to old and new sequences
- complexity, subword complexity, palindrome complexity, and, we might add, squares complexity. The subword
- Cited by 1 (1 self) – Add To MetaCart
-
) SEQUENCES OF LOW ARITHMETICAL COMPLEXITY
- palindrome complexity [2], modified complexity by Nakashima et al. [18], pattern complexity by Restivo
- Add To MetaCart
-
Searching for Gapped Palindromes
- [Dro95], or in general Sturmian words [DP99,DLDL05]. More generally, a so-called palindrome complexity
- Add To MetaCart
-
Palindromes and pseudo- palindromes in episturmian and pseudo-episturmian infinite words
- ]). Also in [8] the authors investigate the sub-word complexity and pseudo-palindromic complexity
- Cited by 4 (3 self) – Add To MetaCart
-
Palindromic prefixes and episturmian words
- to the combinatorial notion of “palindrome complexity” (see for instance [1]). On the other hand, replacing “whole
- Cited by 5 (0 self) – Add To MetaCart
-
Infinite special branches in words associated with beta-expansions
- that in [2] we completely describe the palindromic complexity of the word uβ when β is a confluent Pisot
- Cited by 2 (2 self) – Add To MetaCart

