The following pages link to (Q4341774):
Displaying 50 items.
- Algebraic properties of word equations (Q2343519) (← links)
- Sturmian words and the Stern sequence (Q2345447) (← links)
- Cubic patterns with permutations (Q2353404) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Substitutions with cofinal fixed points (Q2372785) (← links)
- Counting Lyndon factors (Q2401409) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- Coverability and multi-scale coverability on infinite pictures (Q2424689) (← links)
- Strong representations of the polycyclic inverse monoids: cycles and atoms. (Q2428648) (← links)
- Squares in partial words (Q2440165) (← links)
- A noncommutative extension of Mahler's theorem on interpolation series (Q2441657) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- A coloring problem for infinite words (Q2451905) (← links)
- Hopf algebras and Markov chains: two examples and a theory (Q2454080) (← links)
- On a class of infinite words with affine factor complexity (Q2465623) (← links)
- Codes of central Sturmian words (Q2484436) (← links)
- Substitution dynamical systems: characterization of linear repetitivity and applications (Q2496696) (← links)
- A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem (Q2496924) (← links)
- Classifications of dense languages (Q2509153) (← links)
- A sufficient condition for non-uniqueness in binary tomography with absorption (Q2581351) (← links)
- Computing equality-free and repetitive string factorisations (Q2634669) (← links)
- The geometry of the consequences of a single Engel relator. (Q2655755) (← links)
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates (Q2672245) (← links)
- Avoiding square-free words on free groups (Q2672587) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- Analysis of generating functions for special words and numbers and algorithms for computation (Q2682861) (← links)
- Arithmetical complexity of the language of generic limit sets of cellular automata (Q2689368) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Coverability in Two Dimensions (Q2799191) (← links)
- k-Abelian Equivalence and Rationality (Q2817377) (← links)
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (Q2830442) (← links)
- About the multifractal nature of Cantor's bijection: bounds for the Hölder exponent at almost every irrational point (Q2830985) (← links)
- Purely singular continuous spectrum for Sturmian CMV matrices via strengthened Gordon lemmas (Q2832823) (← links)
- On the decidability of semigroup freeness. (Q2905326) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- String Powers in Trees (Q2942264) (← links)
- Greek Ethnic Modal Names vs. Alia Musica’s Nomenclature (Q2942353) (← links)
- Computing Primitively-Rooted Squares and Runs in Partial Words (Q2946044) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- Substitutions, symbolic codings, and discrepancy (Q2975241) (← links)
- On the atoms of algebraic lattices arising in 𝔮-theory (Q2986656) (← links)
- Newton’s Forward Difference Equation for Functions from Words to Words (Q3195682) (← links)
- Decoding Genomic Information (Q3295748) (← links)
- Wiener-type indices of Parikh word representable graphs (Q3390052) (← links)
- Prefix-Suffix Square Completion (Q3449365) (← links)
