String attractors of Rote sequences
In this paper, we describe minimal string attractors (of size two) of pseudopalindromic prefixes of standard complementary-symmetric Rote sequences. Such a class of Rote sequences forms a subclass of binary generalized pseudostandard sequences, i.e., of sequences obtained when iterating palindromic...
Saved in:
| Main Authors: | Lubomíra Dvořáková, Veronika Hendrychová |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-11-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/12385/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On harmonious coloring of hypergraphs
by: Sebastian Czerwiński
Published: (2024-07-01) -
A Note on Graph Burning of Path Forests
by: Ta Sheng Tan, et al.
Published: (2024-08-01) -
A note on limits of sequences of binary trees
by: Rudolf Grübel
Published: (2023-05-01) -
Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering
by: Benjamin Braun, et al.
Published: (2023-12-01) -
Bounds on the Twin-Width of Product Graphs
by: William Pettersson, et al.
Published: (2023-06-01)