Maximal Prefix-Synchronized Codes
From MaRDI portal
Publication:4177474
DOI10.1137/0135034zbMath0394.94024OpenAlexW2002517766MaRDI QIDQ4177474
Leonidas J. Guibas, Andrew M. Odlyzko
Publication date: 1978
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0135034
Related Items (21)
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach ⋮ A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials ⋮ On pattern occurrences in a random text ⋮ Deviations from uniformity in random strings ⋮ Circular codes, loop counting, and zeta-functions ⋮ The use and usefulness of numeration systems ⋮ Robust universal complete codes for transmission and compression ⋮ String matching and 1d lattice gases ⋮ Entropy bounds for multi-word perturbations of subshifts ⋮ SUBSHIFTS OF FINITE TYPE WITH A HOLE ⋮ String overlaps, pattern matching, and nontransitive games ⋮ Periodic oscillations of coefficients of power series that satisfy functional equations ⋮ Unnamed Item ⋮ Multiple pattern matching: a Markov chain approach ⋮ Where to place a hole to achieve a maximal escape rate ⋮ Frequency of symbol occurrences in bicomponent stochastic models ⋮ Pattern statistics and Vandermonde matrices. ⋮ Long repetitive patterns in random sequences ⋮ Synchronization and simplification ⋮ Improved estimates for the number of privileged words ⋮ Formulas for the numbers of sequences containing a given pattern given number of times
This page was built for publication: Maximal Prefix-Synchronized Codes
