String overlaps, pattern matching, and nontransitive games
From MaRDI portal
Cites work
- A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event
- A fast string searching algorithm
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- A Note on the Class-Numbers of Algebraic Number Fields
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- Endliche 0-1-Folgen mit gleichen Teilblöcken.
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3348035 (Why is no real title available?)
- Maximal Prefix-Synchronized Codes
- Non-Transitive Dominance
- Note on a clustering problem
- On the expected duration of a search for a fixed pattern in random data (Corresp.)
- On the Worst-Case Behavior of String-Searching Algorithms
- Periods in strings
- Recurrent composite events
- Some Combinatorial Properties of Free Semigroups
Cited in
(only showing first 100 items - show all)- Bivariate Markov chain embeddable variables of polynomial type
- On occurrence of subpattern and method of gambling teams
- Cross-monotone subsequences
- Algebraic properties of cellular automata
- Analytic models and ambiguity of context-free languages
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- Deviations from uniformity in random strings
- Binary vectors with prescribed subsets of consecutive ones
- Random walks on \(Z^n_2\)
- Applications of the theory of automata in enumeration
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Periods in strings
- Bijective proofs of some classical partition identities
- String matching problems over free partially commutative monoids
- How long does it take to see a flat Brownian path on the average?
- On the waiting time till each of some given patterns occurs as a run
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- On pattern occurrences in a random text
- Explicit distributional results in pattern formation
- On the number of occurrences of a symbol in words of regular languages.
- A unified approach to word occurrence probabilities
- The Goulden-Jackson cluster method for cyclic words
- The first return time test of pseudorandom numbers
- A 2D non-overlapping code over a q-ary alphabet
- Optimal pattern matching algorithms
- On cyclic strings avoiding a pattern
- Waiting times and stopping probabilities for patterns in Markov chains
- An asymptotically optimal layout for the shuffle-exchange graph
- Motif statistics.
- Successions in words and compositions
- Calculating the numbers of representations and the Garsia entropy in linear numeration systems
- Formulas for the numbers of sequences containing a given pattern given number of times
- From Hertzsprung's problem to pattern-rewriting systems
- The Penney's game with group action
- Counting independent sets in Riordan graphs
- Generating functions for lattice paths with several forbidden patterns
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains
- Conway matrices related to a non-transitive head-or-tail game with a \(q\)-sided die and their Hamming weight-spectra via DFT and the MacWilliams duality formula
- Stochastic precedence and minima among dependent variables
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Avoiding cross-bifix-free binary words
- Pattern statistics and Vandermonde matrices.
- Latent periodicity of serine-threonine and tyrosine protein kinases and other protein families
- On the Perron root and eigenvectors associated with a subshift of finite type
- Patterns in random walks and Brownian motion
- Permutations avoiding 1324 and patterns in Łukasiewicz paths
- Generalizations of the Goulden–Jackson cluster method
- Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method
- Periodicity and Repetitions in Parameterized Strings
- Content-based networks: A pedagogical overview
- On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
- On the shape of the fringe of various types of random trees
- Statistical Properties of Factor Oracles
- Long repetitive patterns in random sequences
- Large deviation properties for patterns
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- Optimal Strategy for the First Player in the Penney Ante Game
- Where and when orbits of chaotic systems prefer to go
- Algebraic generating functions for languages avoiding Riordan patterns
- The Goulden—Jackson cluster method: extensions, applications and implementations
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner
- The number of optimal strategies in the Penney-Ante game
- Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges's theorem
- On isomorphism classes of generalized Fibonacci cubes
- Learning Temporal Structures of Random Patterns by Generating Functions
- Reconstructing strings from substrings (Extended abstract)
- Designing optimal- and fast-on-average pattern matching algorithms
- Where to place a hole to achieve a maximal escape rate
- Statistical properties of factor oracles
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- Rarity and exponentiality: an extension of Keilson's theorem, with applications
- On the number of occurrences of sequence patterns
- On the number of word occurrences in a semi-Markov sequence of letters
- Pattern correlation matrices and their properties
- Ranking graphs through hitting times of Markov chains
- Construction of voting situations concordant with ranking patterns
- Ranking and unranking bordered and unbordered words
- A natural bijection for contiguous pattern avoidance in words
- Entropy bounds for multi-word perturbations of subshifts
- Construction of aggregation paradoxes through load-sharing models
- On expected waiting time until given words appear in random sequence
- SUBSHIFTS OF FINITE TYPE WITH A HOLE
- On volumes of spheres for the stem distance
- Subsequence frequency in binary words
- Asymptotic bounds for the number of closed and privileged words
- On the Perron root and eigenvectors of a non-negative integer matrix
- Computation of exact probabilities associated with overlapping pattern occurrences
- On cases where Litt's game is fair
- Block-distribution in random strings
- A new combinatorial interpretation of partial sums of m-step Fibonacci numbers
- Word length, bias and bijections in Penney's ante
- Counting overlapping pairs of words
- The topology of poker
- Shifts of finite type obtained by forbidding a single pattern
- Martingale approach to gambler's ruin problem for correlated randomwalks
- The generalized alice HH vs Bob HT problem
- Proofs of several conjectures from the OEIS
This page was built for publication: String overlaps, pattern matching, and nontransitive games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149796)
