Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words
A bordered box repetition-free word is a finite word w where any given factor of the form asa, with a ∈ Σ and s ∈ Σ∗, occurs at most once. Four existing search algorithms are adapted to search for long bordered box repetition-free...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Graz University of Technology
2023-02-01
|
| Series: | Journal of Universal Computer Science |
| Subjects: | |
| Online Access: | https://lib.jucs.org/article/87330/download/pdf/ |