The following pages link to (Q4681771):
Displaying 50 items.
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- Calculating the numbers of representations and the Garsia entropy in linear numeration systems (Q1938007) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- The perimeter of words (Q2012533) (← links)
- Fractional meanings of nonrepetitiveness (Q2120819) (← links)
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- Cut norm discontinuity of triangular truncation of graphons (Q2154285) (← links)
- Gray codes for Fibonacci \(q\)-decreasing words (Q2163389) (← links)
- Clustering genomic words in human DNA using peaks and trends of distributions (Q2183652) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Characteristic morphisms of generalized episturmian words (Q2271423) (← links)
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
- Moments of the count of a regular expression in a heterogeneous random sequence (Q2283677) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- Wasserstein and Kolmogorov error bounds for variance-gamma approximation via Stein's method. I (Q2297333) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- The operator approach to entropy games (Q2321934) (← links)
- Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015) (Q2343295) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- A maximal entropy stochastic process for a timed automaton (Q2347798) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Dynamical directions in numeration (Q2372766) (← links)
- Fractal representation of the attractive lamination of an automorphism of the free group. (Q2372772) (← links)
- Substitutions with cofinal fixed points (Q2372785) (← links)
- Discrete rotations and symbolic dynamics (Q2373752) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words (Q2373762) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- The identity problem of finitely generated bi-ideals (Q2428497) (← links)
- Average case analysis of Moore's state minimization algorithm (Q2429348) (← links)
- Compound patterns and generating functions: from basic waiting times to counts of occurrence (Q2431573) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Languages with mismatches (Q2456367) (← links)
- Enumeration and generation with a string automata representation (Q2465040) (← links)
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- Distributions associated with general runs and patterns in hidden Markov models (Q2466479) (← links)
- On different generalizations of episturmian words (Q2481949) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Some characterizations of finite Sturmian words. (Q2490813) (← links)
- Non-uniform random generation of generalized Motzkin paths (Q2491216) (← links)
- Periods in extensions of words (Q2509152) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
