The following pages link to (Q4681771):
Displaying 50 items.
- Some applications of the Schutzenberger-Bertoni method (Q2840690) (← links)
- On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
- Decidability Problems for Self-induced Systems Generated by a Substitution (Q2945875) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- (Q2980965) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- On the First <i>k</i> Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source (Q3067851) (← links)
- Locally catenative sequences and Turtle graphics (Q3095041) (← links)
- Distribution of Clump Statistics for a Collection of Words (Q3108475) (← links)
- On digital blocks of polynomial values and extractions in the Rudin–Shapiro sequence (Q3186678) (← links)
- Periodic codings of Bratteli-Vershik systems (Q3299390) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
- Moderate Deviations for Word Counts in Biological Sequences (Q3402056) (← links)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain (Q3435393) (← links)
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics (Q3506945) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005) (← links)
- On a Generalization of Standard Episturmian Morphisms (Q3533007) (← links)
- Bounds on Powers in Strings (Q3533012) (← links)
- Equations on partial words (Q3549287) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- A Linear Time and Space Algorithm for Detecting Path Intersection (Q3648803) (← links)
- (Q4529547) (← links)
- General Framework (Q4613545) (← links)
- A uniform cube-free morphism is<i>k</i>-power-free for all integers<i>k</i>≥ 4 (Q4638265) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Hidden automatic sequences (Q5048458) (← links)
- (Q5111650) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- Music and combinatorics on words: a historical survey (Q5207094) (← links)
- Episturmian words: a survey (Q5321774) (← links)
- Random graph languages (Q5347254) (← links)
- Formulae and Asymptotics for Coefficients of Algebraic Functions (Q5364226) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- Substitutions par des motifs en dimension 1 (Q5425749) (← links)
- Indexing Circular Patterns (Q5452151) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- Equations enforcing repetitions under permutations (Q5918930) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- Nonrepetitive and pattern-free colorings of the plane (Q5964253) (← links)
- The palindromization map (Q6048431) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- Quadratic characters with positive partial sums (Q6075456) (← links)
- Construction of general forms of ordinary generating functions for more families of numbers and multiple variables polynomials (Q6100724) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- (Q6150948) (← links)
- A note on the maximum number of \(k\)-powers in a finite word (Q6614167) (← links)
- Quantum path parallelism: a circuit-based approach to text searching (Q6636089) (← links)
