The DOI matches its Crossref record; 27 of the 28 references it cites were found in a registry or an index.
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Fraenkel, A. S. (1985) · American Mathematical Monthly · doi:10.1080/00029890.1985.11971550 · Cited by 223
Bemerkungen zur Theorie der Diophantischen Approximationen
Ostrowski, A. M. (1922) · Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg · doi:10.1007/bf02940581 · Cited by 206
Automatic Theorem Proving in WalnutPreprint
Mousavi, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06017 · Cited by 158
Self-citationSequences With Subword Complexity 2n
Rote, G. (1994) · Journal of Number Theory · doi:10.1006/jnth.1994.1012 · Cited by 95
Voorstelling van natuurlijke getallen door een som van getallen van fibonacci
Lekkerkerker, C. G. (1951) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 64
A generalization of automatic sequences
Shallit, J. O. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90103-x · Cited by 58
Self-citationCarlitz, L. (1968) · The Fibonacci Quarterly · doi:10.1080/00150517.1968.12431213 · Cited by 50
Decision algorithms for Fibonacci-automatic Words, I: Basic results
Mousavi, H., Schaeffer, L., & Shallit, J. O. (2016) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2016010 · Cited by 45
Self-citationArithmetic progressions in lacunary sets
Brown, T. C., & Freedman, A. R. (1987) · Rocky Mountain Journal of Mathematics · doi:10.1216/rmj-1987-17-3-587 · Cited by 39
Avoiding Three Consecutive Blocks of the Same Size and Same Sum
Cassaigne, J., Currie, J. D., Schaeffer, L., & Shallit, J. O. (2014) · Journal of the ACM · doi:10.1145/2590775 · Cited by 36
Self-citation
Research works printed but not linked: 2
- Blondin Massé, 2011, Fibonacci snowflakes, Ann. Sci. Math. Québec, 35, 141
- Zeckendorf, 1972, Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liège, 41, 179
Cited by
Automatic Theorem Proving in WalnutPreprint
Mousavi, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06017 · Cited by 158
Self-citationDecision algorithms for Fibonacci-automatic Words, I: Basic results
Mousavi, H., Schaeffer, L., & Shallit, J. O. (2016) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2016010 · Cited by 45
Self-citationDecision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
Du, C. F., Mousavi, H., Schaeffer, L., & Shallit, J. O. (2016) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054116500386 · Cited by 23
Self-citationAdditive Number Theory via Automata Theory
Rajasekaran, A., Shallit, J. O., & Smith, T. (2019) · Theory of Computing Systems · doi:10.1007/s00224-019-09929-9 · Cited by 19
Self-citationSums of Palindromes: an Approach via AutomataPreprint
Rajasekaran, A., Shallit, J. O., & Smith, T. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.stacs.2018.54 · Cited by 12
Self-citation
Metadata
- Authors
- Du, C. F., Mousavi, H., Rowland, E., Schaeffer, L., & Shallit, J.
- Affiliations
- University of Waterloo (CA)
- Hofstra University (US)
- MIT Computer Science and Artificial Intelligence Laboratory (US)
- Corresponding author
- Shallit, Jeffrey
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2017-01
- Volume
- 657
- Pages
- 146-162
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2538425405
- Semantic Scholar
- b5b6d01beef5fa4058b6a565b26173298f2f413f
- Cited by
- 16
- References
- 28
- Citations by year
- 2026: 2 · 2025: 2 · 2021: 2 · 2020: 1 · 2019: 3 · 2017: 3
- FWCI
- 2.48
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 1462 d)
- Locations
- Theoretical Computer Science (publishedVersion)
- Funders
- NSERC (RGPIN-105829-2013)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Keywords
- decision-making algorithm, avoidability, pattern avoidance, automatic sequences
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. https://app.cochat.ai/papers/10.1016/j.tcs.2016.10.005
- The paper
- Du, C. F., Mousavi, H., Rowland, E., Schaeffer, L., & Shallit, J. (2017). Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2016.10.005
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
