Pages that link to "Item:Q1149796"
From MaRDI portal
The following pages link to String overlaps, pattern matching, and nontransitive games (Q1149796):
Displaying 50 items.
- Large deviation properties for patterns (Q396708) (← links)
- On isomorphism classes of generalized Fibonacci cubes (Q499490) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Where to place a hole to achieve a maximal escape rate (Q532611) (← links)
- Statistical properties of factor oracles (Q533409) (← links)
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern (Q544885) (← links)
- On the number of occurrences of sequence patterns (Q579945) (← links)
- On volumes of spheres for the stem distance (Q619511) (← links)
- Block-distribution in random strings (Q685893) (← links)
- Frequency of symbol occurrences in bicomponent stochastic models (Q703573) (← links)
- Border correlation of binary words (Q703695) (← links)
- Construction of the weight polynomial for autocorrelation of \(q\)-ary words (Q763559) (← links)
- On enumeration of \(q\)-ary sequences with a fixed number of occurrences of the subblock 00 (Q764090) (← links)
- On the fair coin tossing process (Q796174) (← links)
- An analytical comparison of two string searching algorithms (Q800732) (← links)
- A characterization of the words occurring as factors in a minimum number of words (Q818148) (← links)
- Binary words excluding a pattern and proper Riordan arrays (Q870961) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- On the number of words containing the factor \((aba)^k\) (Q997077) (← links)
- Bivariate Markov chain embeddable variables of polynomial type (Q1039832) (← links)
- On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
- Cross-monotone subsequences (Q1057271) (← links)
- Algebraic properties of cellular automata (Q1058294) (← links)
- Analytic models and ambiguity of context-free languages (Q1088414) (← links)
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials (Q1094743) (← links)
- Deviations from uniformity in random strings (Q1099625) (← links)
- Binary vectors with prescribed subsets of consecutive ones (Q1101451) (← links)
- Random walks on \(Z^n_2\) (Q1106556) (← links)
- Applications of the theory of automata in enumeration (Q1122575) (← links)
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain (Q1147437) (← links)
- Periods in strings (Q1154284) (← links)
- Bijective proofs of some classical partition identities (Q1167170) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- How long does it take to see a flat Brownian path on the average? (Q1210124) (← links)
- On the waiting time till each of some given patterns occurs as a run (Q1263859) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- On pattern occurrences in a random text (Q1351627) (← links)
- Explicit distributional results in pattern formation (Q1370998) (← links)
- On the number of occurrences of a symbol in words of regular languages. (Q1401339) (← links)
- A unified approach to word occurrence probabilities (Q1585335) (← links)
- The Goulden-Jackson cluster method for cyclic words (Q1585502) (← links)
- The first return time test of pseudorandom numbers (Q1612346) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- On cyclic strings avoiding a pattern (Q1744751) (← links)
- Waiting times and stopping probabilities for patterns in Markov chains (Q1747367) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- Motif statistics. (Q1853502) (← links)
