Beyond the runs theorem

Johannes Fischer, Štěpán Holub, Tomohiro I, Moshe Lewenstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In [3], a short and elegant proof was presented showing that a word of length n contains at most n - 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22/23n < 0.957n.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings
EditorsSimon J. Puglisi, Costas S. Iliopoulos, Emine Yilmaz
PublisherSpringer Verlag
Pages277-286
Number of pages10
ISBN (Print)9783319238258
DOIs
StatePublished - 2015
Event22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 - London, United Kingdom
Duration: 1 Sep 20154 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9309

Conference

Conference22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015
Country/TerritoryUnited Kingdom
CityLondon
Period1/09/154/09/15

Keywords

  • Combinatorics on words
  • Lyndon words
  • Runs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Beyond the runs theorem'. Together they form a unique fingerprint.

Cite this