REVIEW 1 cited by
Prefixes of the Fibonacci word
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Prefixes of the Fibonacci word
abstract
Mignosi, Restivo, and Salemi (1998) proved that for all $\epsilon > 0$ there exists an integer $N$ such that all prefixes of the Fibonacci word of length $\geq N$ contain a suffix of exponent $\alpha^2-\epsilon$, where $\alpha = (1+\sqrt{5})/2$ is the golden ratio. In this note we show how to prove an explicit version of this theorem with tools from automata theory and logic. Along the way we gain a better understanding of the repetitive structure of the Fibonacci word.
Forward citations
Cited by 1 Pith paper
-
Bangla-Bayanno: A 52K-Pair Bengali Visual Question Answering Dataset with LLM-Assisted Translation Refinement
A 52,650-pair Bengali VQA dataset built by translating VQA v2 with GPT-4, claimed as the largest open-source Bangla benchmark but weakly validated.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.