The runs theorem and beyond

DOI10.1007/978-3-319-98654-8_2MaRDI QIDQ1622941zbMATH OpenOpenAlexFDO

Authors Tomohiro I

Publication date 22 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-98654-8_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The ``runs theorem
• The ``runs conjecture
• Towards a Solution to the “Runs” Conjecture
• How many runs can a string contain?
• The number of runs in a string

Cited in

(15)

• Repetitions in strings: algorithms and combinatorics
• A further note on runs in independent sequences
• scientific article; zbMATH DE number 5827338 (Why is no real title available?)
• Towards a Solution to the “Runs” Conjecture
• On the maximal number of cubic runs in a string
• Running Clubs-A Combinatorial Investigation
• Understanding maximal repetitions in strings
• On the density of Lyndon roots in factors
• Bannai et al. method proves the \(d\)-step conjecture for strings
• The ``runs theorem
• A new characterization of maximal repetitions by Lyndon trees
• The ``runs conjecture
• On extensions of maximal repeats in compressed strings
• On primary and secondary repetitions in words
• Extension of runs to the continuous-valued sequences

This page was built for publication: The runs theorem and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622941)