arXiv (All)
open access
String attractors and bi-infinite words
String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which captures an occurrence of every factor. While one-sided infinite words admitting a finite string attractor are eventually periodic, the situation is different for two-si
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words#1247877
- Attractor-Based Models for Sequences and Pattern Generation in Neural Circuits.#135770
- Non-Perturbative Real Topological Strings#155458
- Shuffle squares in smooth binary words and the Kolakoski sequence#1186576
- From closed to open strings: the tensionless route in Kalb-Ramond background and noncommutativity#1423749
Record · ID 1423666
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive