The following pages link to (Q4341774):
Displaying 50 items.
- Spiraling and folding: the word view (Q548656) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- The formal series Witt transform (Q556844) (← links)
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants (Q617857) (← links)
- The \((1-\mathbb{E})\)-transform in combinatorial Hopf algebras (Q626442) (← links)
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways (Q638553) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- On Christoffel and standard words and their derivatives (Q728275) (← links)
- On uniformly continuous functions for some profinite topologies (Q728284) (← links)
- The extended equation of Lyndon and Schützenberger (Q730507) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- A characterization of rational D0L power series (Q766157) (← links)
- New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- Morphic sequences versus automatic sequences (Q832916) (← links)
- Lyndon words formalized in Isabelle/HOL (Q832940) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials (Q876114) (← links)
- Equivalence of simple functions (Q880171) (← links)
- A presentation by generators and relations of Nichols algebras of diagonal type and convex orders on root systems. (Q891767) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Reconstruction of a word from a multiset of its factors (Q930915) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Substitutions on two letters, cutting segments and their projections (Q933208) (← links)
- New identities in dendriform algebras (Q947492) (← links)
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions (Q965231) (← links)
- Quantum quasi-shuffle algebras. (Q965888) (← links)
- Border correlations of partial words (Q987385) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- On structural properties of eta-expansions of identity (Q1014452) (← links)
- On finitely generated idempotent semigroups. (Q1014779) (← links)
- Intersecting periodic words (Q1022587) (← links)
- On highly palindromic words (Q1028422) (← links)
- Long cycles in \(abc\)-permutations (Q1039985) (← links)
- Primitive partial permutation representations of the polycyclic monoids and branching function systems. (Q1046885) (← links)
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets (Q1296754) (← links)
- Biinfinite words with maximal recurrent unbordered factors. (Q1401214) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- Lyndon words, permutations and trees. (Q1426043) (← links)
- Composition-diamond lemma for associative conformal algebras. (Q1427371) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- Quantum evolution of words (Q1605340) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Leaf realization problem, caterpillar graphs and prefix normal words (Q1637224) (← links)
