The following pages link to (Q4341774):
Displaying 50 items.
- Palindromic Complexity of Trees (Q3451098) (← links)
- Unary Patterns with Permutations (Q3451101) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- Defect theorem in the plane (Q3512595) (← links)
- A morphic approach to combinatorial games: the Tribonacci case (Q3515468) (← links)
- Subsequence Counting, Matrix Representations and a Theorem of Eilenberg (Q3540092) (← links)
- How Many Figure Sets Are Codes? (Q3540129) (← links)
- Least Periods of Factors of Infinite Words (Q3549293) (← links)
- Generalizations of Parikh mappings (Q3566349) (← links)
- 3-Way Composition of Weighted Finite-State Transducers (Q3602821) (← links)
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (Q3618580) (← links)
- Definability in the Infix Order on Words (Q3637247) (← links)
- Christoffel and Fibonacci Tiles (Q3648773) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- (Q4529547) (← links)
- Newton series, coinductively: a comparative study of composition (Q4559600) (← links)
- Positive solutions for super-sublinear indefinite problems: High multiplicity results via coincidence degree (Q4596338) (← links)
- An analog of the prime number theorem for finite fields via truncated polylogarithm expansions (Q4600713) (← links)
- (Q4606689) (← links)
- Continued fractions with $SL(2, Z)$-branches: combinatorics and entropy (Q4635484) (← links)
- Non-primitive words of the form<b>p</b><b>q</b><sup><b>m</b></sup> (Q4637856) (← links)
- Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator (Q4640340) (← links)
- (Q4681771) (← links)
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ (Q4685343) (← links)
- On the distribution of characteristic parameters of words (Q4800266) (← links)
- On the distribution of characteristic parameters of words II (Q4800267) (← links)
- The algebraic entropy of classical mechanics (Q4833050) (← links)
- Reconstruction of hv-convex Binary Matrices from Their Absorbed Projections (Q4917112) (← links)
- Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata (Q4988958) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- (Q5020521) (← links)
- Identities for Dirichlet and Lambert-type series arising from the numbers of a certain special word (Q5028822) (← links)
- Computation of k-ary Lyndon words using generating functions and their differential equations (Q5029977) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Hidden automatic sequences (Q5048458) (← links)
- Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions (Q5087114) (← links)
- (Q5088889) (← links)
- A Mahler's Theorem for Word Functions (Q5092327) (← links)
- Algebras defined by Lyndon words and Artin-Schelter regularity (Q5092870) (← links)
- On the automorphism group of minimal -adic subshifts of finite alphabet rank (Q5095130) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- (Q5109512) (← links)
- (Q5136316) (← links)
- Nearest constrained circular words (Q5140768) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- A Multiset Version of Even-Odd Permutations Identity (Q5205024) (← links)
- Creating improvisations on chord progressions using suffix trees (Q5207099) (← links)
- Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words (Q5212139) (← links)
- On some root multiplicities for Nichols algebras of diagonal type over arbitrary fields (Q5238181) (← links)
