The following pages link to Maximal Prefix-Synchronized Codes (Q4177474):
Displayed 21 items.
- Where to place a hole to achieve a maximal escape rate (Q532611) (← links)
- Frequency of symbol occurrences in bicomponent stochastic models (Q703573) (← links)
- Synchronization and simplification (Q755320) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← 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)
- The use and usefulness of numeration systems (Q1119959) (← links)
- String overlaps, pattern matching, and nontransitive games (Q1149796) (← links)
- Periodic oscillations of coefficients of power series that satisfy functional equations (Q1163668) (← 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)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Formulas for the numbers of sequences containing a given pattern given number of times (Q2081003) (← links)
- Pattern statistics and Vandermonde matrices. (Q2490816) (← links)
- Circular codes, loop counting, and zeta-functions (Q2639832) (← links)
- Long repetitive patterns in random sequences (Q3859018) (← links)
- Improved estimates for the number of privileged words (Q4639881) (← links)
- (Q6134947) (← links)
- Entropy bounds for multi-word perturbations of subshifts (Q6143505) (← links)
- SUBSHIFTS OF FINITE TYPE WITH A HOLE (Q6172261) (← links)