Show simple item record

dc.contributor.authorCrochemore, M.
dc.contributor.authorIliopoulos, Costas
dc.contributor.authorKubica, M.
dc.contributor.authorRadoszewski, J.
dc.contributor.authorRytter, W.
dc.contributor.authorWalen, T.
dc.contributor.editorAdrian-Horia Dediu, Henning Fernau and Carlos Martin-Vide
dc.date.accessioned2017-01-30T15:23:14Z
dc.date.available2017-01-30T15:23:14Z
dc.date.created2015-03-03T20:13:40Z
dc.date.issued2010
dc.identifier.citationCrochemore, M. and Iliopoulos, C. and Kubica, M. and Radoszewski, J. and Rytter, W. and Walen, T. 2010. On the maximal number of cubic runs in a string, in Adrian-Horia Dediu, Henning Fernau and Carlos Martin-Vide (ed), 4th International Conference on Language and Automata Theory and Applications, LATA 2010, May 24 2010, pp. 227-238. Trier: Springer.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/45763
dc.identifier.doi10.1007/978-3-642-13089-2_19
dc.description.abstract

A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a period p such that 2p =|v|.The maximal number of runs in a string of length n has been thoroughly studied, and is known to be between 0.944 n and 1.029 n.In this paper we investigate cubic runs, in which the shortest period p satis?es 3p =|v|. We show the upper bound of 0.5 n on the maximal number of such runs in a string of length n, and construct an in?nite sequence of words over binary alphabet for which the lower bound is 0.406 n.

dc.publisherSpringer
dc.relation.urihttp://www.springerlink.com/content/73w55281j86r8w18
dc.titleOn the maximal number of cubic runs in a string
dc.typeConference Paper
dcterms.source.startPage227
dcterms.source.endPage238
dcterms.source.titleLecture notes in computer science, volume 6031: language and automata theory and applications - LATA 2010
dcterms.source.seriesLecture notes in computer science, volume 6031: language and automata theory and applications - LATA 2010
dcterms.source.isbn9783642130885
dcterms.source.conference4th International Conference on Language and Automata Theory and Applications, LATA 2010
dcterms.source.conference-start-dateMay 24 2010
dcterms.source.conferencelocationTrier
dcterms.source.placeHeidelberg
curtin.departmentDigital Ecosystems and Business Intelligence Institute (DEBII)
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record