Maximal Prefix-Synchronized Codes
From MaRDI portal
Publication:4177474
DOI10.1137/0135034zbMATH Open0394.94024OpenAlexW2002517766MaRDI QIDQ4177474FDOQ4177474
Leonidas Guibas, Andrew 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
Cited In (24)
- Title not available (Why is that?)
- Entropy bounds for multi-word perturbations of subshifts
- Asymptotic bounds for the number of closed and privileged words
- Multiple pattern matching: a Markov chain approach
- Frequency of symbol occurrences in bicomponent stochastic models
- Long repetitive patterns in random sequences
- String overlaps, pattern matching, and nontransitive games
- 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 maximal synchronous codes.
- The use and usefulness of numeration systems
- SUBSHIFTS OF FINITE TYPE WITH A HOLE
- String matching and 1d lattice gases
- Improved estimates for the number of privileged words
- Periodic oscillations of coefficients of power series that satisfy functional equations
- Deviations from uniformity in random strings
- Pattern statistics and Vandermonde matrices.
- On pattern occurrences in a random text
- Circular codes, loop counting, and zeta-functions
- Robust universal complete codes for transmission and compression
- Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
- Formulas for the numbers of sequences containing a given pattern given number of times
- Where to place a hole to achieve a maximal escape rate
- Synchronization and simplification
This page was built for publication: Maximal Prefix-Synchronized Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177474)
