Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/24322

Title: Hide and seek with repetitions
Authors: Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Keywords: Stringology
Pattern matching
Combinatorics on words
Issue Date: 2017
Abstract: Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism. Thus, such occurrences can be regarded as hidden repetitive structures of, or within, a word. We solve fundamental algorithmic questions on pseudo-repetitions by application of insightful combinatorial results on words. More precisely, we efficiently decide whether a word is a pseudo-repetition and find all the pseudo-repetitive factors of a word. We also approach the problem of deciding whether there exists an anti-/morphism for which a word is a pseudo-repetition. We show that some variants of this later problem are efficiently solvable, while some others are NPcomplete.
Description: This is a pre-print of an article submitted to the Journal of Computer and System Sciences, it is in closed access.
Version: Submitted for publication
URI: https://dspace.lboro.ac.uk/2134/24322
Publisher Link: http://www.sciencedirect.com/science/journal/00220000
ISSN: 1090-2724
Appears in Collections:Closed Access (Computer Science)

Files associated with this item:

File Description SizeFormat
GMMN_JCSS.pdfSubmitted version441.6 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.