Pages that link to "Item:Q1320503"
From MaRDI portal
The following pages link to Sequences with subword complexity \(2n\) (Q1320503):
Displaying 50 items.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability (Q346252) (← links)
- Constructing partial words with subword complexities not achievable by full words (Q428848) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- On minimal Sturmian partial words (Q534335) (← links)
- Rotation encoding and self-similarity phenomenon (Q558113) (← links)
- *-Sturmian words and complexity (Q558168) (← links)
- Palindromic complexity of codings of rotations (Q650872) (← links)
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles (Q671428) (← links)
- Enumeration formula for \((2,n)\)-cubes in discrete planes (Q713312) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials (Q876114) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- On the triplex substitution -- combinatorial properties (Q943630) (← links)
- Codings of rotations and continued fractions (Q1273710) (← links)
- Complexity and special factors (Q1280227) (← links)
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity (Q1285569) (← links)
- Complexity for finite factors of infinite sequences (Q1292491) (← links)
- Modified complexity and *-Sturmian word (Q1302093) (← links)
- On the complexity of infinite sequences (Q1326948) (← links)
- Canonical positions for the factors in paperfolding sequences (Q1329729) (← links)
- On the transcendence of real numbers with a regular expansion. (Q1415365) (← links)
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). (Q1426035) (← links)
- Balances for fixed points of primitive substitutions. (Q1426036) (← links)
- Coding rotations on intervals (Q1603687) (← links)
- Transcendence of Sturmian or morphic continued fractions (Q1612522) (← links)
- A set of sequences of complexity \(2n+1\) (Q1678348) (← links)
- On powers of words occurring in binary codings of rotations (Q1775724) (← links)
- Palindrome complexity. (Q1853729) (← links)
- The complexity of generalized Sturmian sequences (Q1922164) (← links)
- Morphisms generating antipalindromic words (Q2198987) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Characterization of rotation words generated by homeomorphisms on a circle (Q2341736) (← links)
- The subword complexity of a class of infinite binary words (Q2370831) (← links)
- On the arithmetical complexity of Sturmian words (Q2373754) (← links)
- Palindromic closures using multiple antimorphisms (Q2446105) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Subword complexity and projection bodies (Q2474326) (← links)
- Maximal pattern complexity of words over \(\ell\) letters (Q2581466) (← links)
- Properties of a class of Toeplitz words (Q2672565) (← links)
- Sequences of low complexity: Automatic and Sturmian sequences (Q2711280) (← links)
- Complexity functions for two-dimensional sequences (Q2765706) (← links)
- Abelian complexity and frequencies of letters in infinite words (Q2833546) (← links)
- Codings of rotations on two intervals are full (Q2851477) (← links)
- Lamination languages (Q2874006) (← links)
- Three complexity functions (Q2911427) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- An isolated point in the Heinis spectrum (Q3186673) (← links)
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function (Q3386617) (← links)
- Describing the Set of Words Generated by Interval Exchange Transformation (Q3579923) (← links)
- Palindromes in infinite ternary words (Q3653092) (← links)
