Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 163

The DOI matches its Crossref record.

The ring of k-regular sequences

Allouche, Jean-Paul, Shallit, Jeffrey·1992·Theoretical Computer Science
DOI 10.1016/0304-3975(92)90001-v
Open this paper in CoChat — free account

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0304-3975(92)90001-v

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 66

  1. Allouche, 1982, Somme des chiffres et transcendance, Bull. Soc. Math. France, 110, 279, 10.24033/bsmf.1962 · doi:10.24033/bsmf.1962
  2. Allouche, 1983, Suites infinies à répétitions bornées, Sém. de Théorie des Nombres de Bordeaux
  3. Allouche, 1987, Automates finis en théorie des nombres, Exposition Math., 5, 239
  4. Allouche, 1989, Note sur un article de Sharif et Woodcock, Sém. de Théorie des Nombres de Bordeaux, 1, 163, 10.5802/jtnb.12 · doi:10.5802/jtnb.12
  5. Allouche, 1992, Pattern spectra, substring enumeration, and automatic sequences, Theoret. Comput. Sci., 94, 161, 10.1016/0304-3975(92)90032-B · doi:10.1016/0304-3975(92)90032-b
  6. Babbage, 1822, Observations on the application of machinery to the computation of mathematical tables, Memoirs of the Astronomical Society, 1, 311
  7. Bellman, 1948, On a problem in additive number theory, Ann. Math., 49, 333, 10.2307/1969281 · doi:10.2307/1969281
  8. Blanchard, 1982, Symétrie et transcendance, Bull. Sci. Math., 106, 325
  9. Brlek, 1989, Enumeration of factors in the Thue-Morse word, Discrete Appl. Math., 24, 83, 10.1016/0166-218X(92)90274-E · doi:10.1016/0166-218x(92)90274-e
  10. de Bruijn, 1948, On Mahler's partition problem, Indag. Math., 10, 210
  11. de Bruijn, 1964, Some direct decompositions of the set of integers, Math. Tables Aids Comput., 18, 537, 10.1090/S0025-5718-1964-0167447-9 · doi:10.1090/s0025-5718-1964-0167447-9
  12. Cheo, 1955, A problem on the k-adic representations of positive integers, Acta. Math. Sinica, 5, 433
  13. Choffrut, 1988, Counting with rational functions, Theoret. Comput. Sci., 58, 81, 10.1016/0304-3975(88)90020-5 · doi:10.1016/0304-3975(88)90020-5
  14. Christol, 1980, Suites algébriques, automates et substitutions, Bull. Soc. Math. France, 108, 401, 10.24033/bsmf.1926 · doi:10.24033/bsmf.1926
  15. Clements, 1965, A sequence of (± 1)-determinants with large values, Proc. Amer. Math. Soc., 16, 548
  16. Cobham, 1969, On the base-dependence of sets of numbers recognizable by finite automata, Math. Systems Theory, 3, 186, 10.1007/BF01746527 · doi:10.1007/bf01746527
  17. Cobham, 1972, Uniform tag sequences, Math. Systems Theory, 6, 164, 10.1007/BF01706087 · doi:10.1007/bf01706087
  18. Coquet, 1983, A summation formula related to the binary digits, Invent. Math., 73, 107, 10.1007/BF01393827 · doi:10.1007/bf01393827
  19. van der Corput, 1935, Verteilungsfunktionen, Proc. Ned. Akad. v. Wet., 38, 813
  20. Davis, 1973, Hilbert's tenth problem is unsolvable, Amer. Math. Monthly, 80, 233, 10.2307/2318447 · doi:10.2307/2318447
  21. Dekking, 1982, FOLDS!, Math. Intelligencer, 4, 130, 10.1007/BF03023555 · doi:10.1007/bf03023555
  22. P. Dumas, Suite automatiques à valeurs dans un anneau commutatif, preprint.
  23. Erdös, 1936, On some sequences of integers, J. London Math. Soc., 11, 261, 10.1112/jlms/s1-11.4.261 · DOI · Paper page
  24. Fine, 1947, Binomial coefficients modulo a prime, Amer. Math. Monthly, 54, 589, 10.2307/2304500 · doi:10.2307/2304500
  25. Flajolet, 1980, A note on Gray code and odd-even merge, SIAM J. Comput., 9, 142, 10.1137/0209014 · doi:10.1137/0209014
  26. Gilbert, 1958, Gray codes and paths on the n-cube, Bell Sys. Tech. J., 37, 815, 10.1002/j.1538-7305.1958.tb03887.x · doi:10.1002/j.1538-7305.1958.tb03887.x
  27. Ginsburg, 1964, Bounded ALGOL-like languages, Trans. Amer. Math. Soc., 113, 333
  28. Glaisher, 1899, On the residue of a binomial-theorem coefficient with respect to a prime modulus, Quart. J. Pure Appl. Math., 30, 150
  29. Graham, 1978, Addition chains with multiplicative cost, Discrete. Math., 23, 115, 10.1016/0012-365X(78)90111-5 · doi:10.1016/0012-365x(78)90111-5
  30. Halton, 1960, On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals, Numer. Math., 2, 84, 10.1007/BF01386213 · DOI · Paper page
  31. Holter, 1986, On a new class of planar fractals: the Pascal-Sierpinski gaskets, J. Phys. A: Math. Gen., 19, 1753, 10.1088/0305-4470/19/9/047 · doi:10.1088/0305-4470/19/9/047
  32. 1989, 29th International Math Olympiad-Solutions, Math. Mag., 62, 212
  33. Jacobs, 1969, 0–1-Sequences of Toeplitz type, Z. Wahrscheinlichkeitstheorie verw. Geb., 13, 123, 10.1007/BF00537017 · doi:10.1007/bf00537017
  34. Knuth, 1966, An almost linear recurrence, Fib. Quart, 4, 117, 10.1080/00150517.1966.12431371 · doi:10.1080/00150517.1966.12431371
  35. Knuth, 1973, Sorting and Searching, Vol. 3
  36. Knuth, 1973, Fundamental Algorithms, Vol. 1
  37. Lakhtakia, 1989, Self-similar sequences and chaos from Gauss sums, Comput. & Graphics, 13, 59, 10.1016/0097-8493(89)90038-1 · doi:10.1016/0097-8493(89)90038-1
  38. Lakhtakia, 1988, Fractal sequences derived from the self-similar extensions of the Sierpinski gasket, J. Phys. A: Math. Gen., 21, 1925, 10.1088/0305-4470/21/8/030 · DOI
  39. Lehmer, 1986, Integers with digits 0 or 1, Math. Comp., 46, 683, 10.1090/S0025-5718-1986-0829638-5 · doi:10.1090/s0025-5718-1986-0829638-5
  40. Levitt, 1968, A study of the data communication problems in a self-repairable multiprocessor, Proc. AFIPS Conf., 32, 515
  41. Lipton, 1977, Word problems solvable in logspace, J. ACM, 24, 522, 10.1145/322017.322031 · doi:10.1145/322017.322031
  42. Loxton, 1987, An awful problem about integers in base four, Acta Arith., 49, 193, 10.4064/aa-49-2-193-203 · doi:10.4064/aa-49-2-193-203
  43. Loxton, 1988, Arithmetic properties of automata: regular sequences, J. Reine Angew. Math., 392, 57
  44. de Luca, 1989, Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups, Theoret. Comput. Sci., 63, 333, 10.1016/0304-3975(89)90013-3 · doi:10.1016/0304-3975(89)90013-3
  45. Mahler, 1940, On a special functional equation, J. London Math. Soc., 15, 115, 10.1112/jlms/s1-15.2.115 · doi:10.1112/jlms/s1-15.2.115
  46. Mahler, 1951, On the generating function of the integers with amissing digit, J. Indian Math. Soc., 15, 33
  47. Mauduit, 1989, Substitutions et ensembles normaux, Habilitation
  48. Mendès France, 1989, From geometry to Euler identities, Theoret. Comput. Sci., 65, 213, 10.1016/0304-3975(89)90045-5 · doi:10.1016/0304-3975(89)90045-5
  49. Mendès France, 1989, Wire bending, J. Combin. Theory, A, 50, 1, 10.1016/0097-3165(89)90002-2 · doi:10.1016/0097-3165(89)90002-2
  50. Morton, 1989, Paper folding, digit patterns, and groups of arithmetic fractals, Proc. London Math. Soc., 59, 253, 10.1112/plms/s3-59.2.253 · doi:10.1112/plms/s3-59.2.253
  51. Moser, 1962, An application of generating series, Math. Mag., 35, 37, 10.2307/2689100 · doi:10.2307/2689100
  52. Newman, 1969, On the number of binary digits in a multiple of three, Proc. Amer. Math. Soc., 21, 719, 10.1090/S0002-9939-1969-0244149-8 · doi:10.1090/s0002-9939-1969-0244149-8
  53. Newman, 1975, Binary digit distribution over naturally defined sequences, Trans. Amer. Math. Soc., 213, 71, 10.1090/S0002-9947-1975-0384734-3 · doi:10.1090/s0002-9947-1975-0384734-3
  54. Osbaldestin, 1989, A correlated digital sum problem associated with sums of three squares, Bull. London Math. Soc., 21, 369, 10.1112/blms/21.4.369 · doi:10.1112/blms/21.4.369
  55. Prodinger, 1983, Non-repetitive sequences and Gray code, Discrete Math., 43, 113, 10.1016/0012-365X(83)90027-4 · doi:10.1016/0012-365x(83)90027-4
  56. Rauzy, 1982, Suites à termes dans un alphabet fini, Sém. de Théorie des Nombres de Bordeaux, 25.01
  57. Reingold, 1981, On a greedy heuristic for complete matching, SIAM J. Comput., 10, 676, 10.1137/0210050 · doi:10.1137/0210050
  58. Reznick, 1984, A new sequence with many properties, Abs. Amer. Math. Soc., 5, 16
  59. Reznick, 1985, Some extremal problems for continued fractions, Illinois J. Math., 29, 261, 10.1215/ijm/1256045729 · doi:10.1215/ijm/1256045729
  60. de Rham, 1947, Un peu de mathématiques à propos d'une courbe plane, Elem. Math., 2, 73
  61. Salon, 1989, Quelles tuiles! (Pavages apériodiques du plan et automates bidimensionnels), Sém. de Théorie des Nombres de Bordeaux, 1, 1, 10.5802/jtnb.1 · doi:10.5802/jtnb.1
  62. Schützenberger, 1961, On the definition of a family of automata, Inform. and Control, 4, 245, 10.1016/S0019-9958(61)80020-X · DOI · Paper page
  63. Shiu, 1988, Counting sums of three squares, Bull. London Math. Soc., 20, 203, 10.1112/blms/20.3.203 · doi:10.1112/blms/20.3.203
  64. Stern, 1858, Über eine zahlentheoretische Funktion, J. Reine Angew. Math., 55, 193, 10.1515/crll.1858.55.193 · DOI · Paper page
  65. Strauss, 1990, Advanced Problem 6625, Amer. Math. Monthly, 97, 252, 10.2307/2324705 · doi:10.2307/2324705
  66. Wagstaff, 1975, The Schnirelmann density of the sums of three squares, Proc. Amer. Math. Soc., 52, 1, 10.1090/S0002-9939-1975-0379425-4 · doi:10.1090/s0002-9939-1975-0379425-4

Cited by

See all 163

Metadata

Authors
Allouche, J.-P., & Shallit, J.
Venue
Theoretical Computer Science
Publisher
Elsevier BV
Published
1992-05
Volume
98
Issue
2
Pages
163-197
ISSN
0304-3975
DOI
10.1016/0304-3975(92)90001-v
Cited by
163
References
0
Language
en
Licence

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: The ring of k-regular sequences. https://app.cochat.ai/papers/10.1016/0304-3975(92)90001-v
The paper
Allouche, J.-P., & Shallit, J. (1992). The ring of k-regular sequences. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(92)90001-v

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.