arXiv (All)
open access
Letter frequency in shifts of finite type with one forbidden word
This work considers combinatorial and statistical aspects of {\em{shifts of finite type}}, which are families of words over a finite alphabet which avoid a fixed class of {\emph{forbidden}} sub-words. The overarching question we are interested in is: how do local statistics of a uniformly random ele
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
- Estimand or estimator? Comparing vowel overlap measures against a known ground truth#423347
- Conditioned random walks on linear groups I: construction of the target harmonic measure#1158050
- Filtered not mixed: filtering-based online gating for mixture of large language models#248013
- Property (T) for random groups in the density model with $d > \frac{1}{4}$#1035220
- Distribution-free inference on the number of changepoints#985606
Record · ID 987699
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