arXiv (OAI Expanded)
open access
On the number of palindromic factors of low complexity words
Factor complexity counts the distinct factors of each length in an infinite word, while palindromic complexity counts those invariant under reversal. For recurrent aperiodic words with reversal-closed language, the total number of palindromic factors in two consecutive lengths is at most the one-ste
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
- Collation Model for LJS 384: [De philosophia mundi] ... [etc.].#413202
- Partial Word Knowledge Growth in Children With LLD#842574
- Quantitative tiling stability from quadratic discrepancy in Hamming spaces#1117559
- Descent generating polynomials for ($n-3$)- and ($n-4$)-stack-sortable (pattern-avoiding) permutations#1082938
- Benjamin Franklin, Orthoepist and Phonetician: Vol. 1: Language, Literacy and Social Mobility in Franklin’s World (PDF)#264742
Record · ID 1122619
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