Open and Closed Words

Research output: Contribution to journalArticlepeer-review

Abstract

Combinatorics on words aims at finding deep connections between propertiesof sequences. The resulting theoretical findings are often used in thedesign of efficient combinatorial algorithms for string processing, but mayalso have independent interest, especially in connection with other areas ofdiscrete mathematics. The property we discuss here is, for a given finiteword, that of being closed. A finite word is called closed if it has length ≤ 1or it contains a proper factor (substring) that occurs both as a prefix and as asuffix but does not have internal occurrences. Otherwise the word is calledopen. We illustrate several aspects of open and closed words and factors,and propose some open problems.
Original languageEnglish
Pages (from-to)140-149
Number of pages10
JournalBULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE
Volume123
Publication statusPublished - 2017

Fingerprint Dive into the research topics of 'Open and Closed Words'. Together they form a unique fingerprint.

Cite this