scientific article; zbMATH DE number 5717191
From MaRDI portal
Publication:3565863
zbMATH Open1196.68180MaRDI QIDQ3565863FDOQ3565863
Authors: Jamie Simpson 
Publication date: 7 June 2010
Title of this publication is not available (Why is that?)
Recommendations
- The maximal number of runs in standard Sturmian words
- The maximal number of cubic runs in a word
- The number of q-ary words with restrictions on the length of the maximal run
- The Number of Runs in Sturmian Words
- The expected number of runs in a word
- Publication:4934345
- On the Maximal Sum of Exponents of Runsin a String
- On the maximal sum of exponents of runs in a string
- A nearest integer solution to the longest run of randomly generated words
- On the maximal number of cubic runs in a string
Cited In (20)
- The total run length of a word
- Efficiently computing runs on a trie
- Title not available (Why is that?)
- On the maximal sum of exponents of runs in a string
- The ``runs conjecture
- The maximal number of cubic runs in a word
- Some results on the number of periodic factors in words
- Computing regularities in strings: a survey
- Extracting powers and periods in a word from its runs structure
- Prefix frequency of lost positions
- On the average number of regularities in a word
- Lower bounds for the number of repetitions in 2D strings
- On the structure of run-maximal strings
- On primary and secondary repetitions in words
- Computing primitively-rooted squares and runs in partial words
- Average number of occurrences of repetitions in a necklace
- Computing the number of cubic runs in standard Sturmian words
- The ``runs theorem
- Three overlapping squares: the general case characterized \& applications
- On the Maximal Sum of Exponents of Runsin a String
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565863)
