@inproceedings{10a34bc8c69b40e0944838c8c923b8d9,
title = "Beyond the runs theorem",
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.",
keywords = "Combinatorics on words, Lyndon words, Runs",
author = "Johannes Fischer and {\v S}t{\v e}p{\'a}n Holub and Tomohiro I and Moshe Lewenstein",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 ; Conference date: 01-09-2015 Through 04-09-2015",
year = "2015",
doi = "10.1007/978-3-319-23826-5\_27",
language = "الإنجليزيّة",
isbn = "9783319238258",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "277--286",
editor = "Puglisi, \{Simon J.\} and Iliopoulos, \{Costas S.\} and Emine Yilmaz",
booktitle = "String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings",
address = "ألمانيا",
}