Long repetitive patterns in random sequences
From MaRDI portal
Publication:3859018
DOI10.1007/BF00531434zbMATH Open0424.60036OpenAlexW2087456401WikidataQ104672899 ScholiaQ104672899MaRDI QIDQ3859018FDOQ3859018
Authors: Leonidas Guibas, Andrew Odlyzko
Publication date: 1980
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00531434
Cites Work
- Title not available (Why is that?)
- On a new law of large numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- String overlaps, pattern matching, and nontransitive games
- Title not available (Why is that?)
- On sequences of 'pure heads'
- A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event
- Periods in strings
- Maximal Prefix-Synchronized Codes
- Title not available (Why is that?)
Cited In (35)
- On sparse languages \(L\) such that \(LL= \Sigma^*\)
- Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
- Maximal success durations for a semi-Markov process
- Explicit distributional results in pattern formation
- An Erdős-Rényi law with shifts
- On longest consecutive patterns in Markov chains
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- A note on randomness
- On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings
- Binary words excluding a pattern and proper Riordan arrays
- Lucasnomial Fuss-Catalan numbers and related divisibility questions
- Understanding nonsense correlation between (independent) random walks in finite samples
- Asymptotic estimate for the multinomial coefficients
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- On the asymptotic normality in the problem on the tuples repetitions in a marked complete tree
- Avoiding cross-bifix-free binary words
- Asymptotic independence of 'pure head' stopping times
- Longest runs in coin tossing
- On coincidences of tuples in a binary tree with random labels of vertices
- Higher-order dangers and precisely constructed taxa in models of randomness
- Regularities and irregularities in a random 0,1 sequence
- An extreme value theory for long head runs
- The Hausdorff dimension of level sets described by Erdős-Rényi average
- Rate of convergence in the problem of the longest head-run
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
- Combinatorics of geometrically distributed random variables: Run statistics
- Longest runs in a sequence of \(m\)-dependent random variables
- Algebraic generating functions for languages avoiding Riordan patterns
- On the length of the longest run in a multi-state Markov chain.
- Runs in coin tossing: a general approach for deriving distributions for functionals
- Measures of distinctness for random partitions and compositions of an integer
- Matching rectangles in d-dimensions: Algorithms and laws of large numbers
- On long runs of heads and tails
- On long runs of heads and tails. II
- Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence
This page was built for publication: Long repetitive patterns in random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859018)