On the Prefix–Suffix Duplication Reduction

DOI10.1142/S0129054120400067zbMath1430.68144OpenAlexW2888404656MaRDI QIDQ5217116

Robert Mercaş, Daniel Reidenbach, Szilárd Zsolt Fazekas

Publication date: 21 February 2020

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120400067

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regularity of languages generated by copying systems
• An optimal algorithm for computing the repetitions in a word
• On the regularity of languages on a binary alphabet generated by copying systems
• Uniformly bounded duplication languages
• Squares, cubes, and time-space efficient string searching
• Prefix-suffix square reduction
• Prefix-suffix duplication
• On Prefix/Suffix-Square Free Words
• Prefix-Suffix Square Completion
• Closure of Language Classes Under Bounded Duplication
• Duplication Roots
• Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results
• Aspects of Molecular Computing

This page was built for publication: On the Prefix–Suffix Duplication Reduction