Maximal unbordered factors of random strings

DOI10.1007/978-3-319-46049-9_9zbMath1397.68149arXiv1704.04472OpenAlexW3105441762MaRDI QIDQ5916287

Mathias Bæk Tejs Knudsen, Patrick Hagge Cording, Tomasz Kociumaka, Travis Gagie

Publication date: 17 October 2018

Published in: Theoretical Computer Science, String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.04472

zbMATH Keywords

borderscombinatorics on stringsunbordered factors

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (3)

Smallest and Largest Block Palindrome Factorizations ⋮ Unnamed Item ⋮ Maximal unbordered factors of random strings

Cites Work

• Unnamed Item
• Unnamed Item
• The Ehrenfeucht-Silberger problem
• Periodicity and unbordered segments of words
• Relationship between the period of a finite word and the length of its unbordered segments
• Une caractérisation des mots périodiques
• On Maximal Unbordered Factors
• Periodicity and unbordered words
• Smoothed analysis of algorithms
• Fast Pattern Matching in Strings
• Periods and borders of random words
• Internal Pattern Matching Queries in a Text and Applications
• Maximal unbordered factors of random strings

This page was built for publication: Maximal unbordered factors of random strings