Cobham's theorem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cobham's theorem" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

4ams.org

451^st place

277^th place

4arxiv.org

69^th place

59^th place

3semanticscholar.org

11^th place

8^th place

2wikipedia.org

low place

2zbmath.org

1,923^rd place

1,068^th place

2worldcat.org

5^th place

1ujf-grenoble.fr

low place

1cnrs.fr

2,402^nd place

5,549^th place

1uc.pt

6,989^th place

low place

1ems-ph.org

low place

1core.ac.uk

1,734^th place

1,312^th place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1tucs.fi

low place

1eatcs.org

low place

1web.archive.org

1^st place

1ens-lyon.fr

6,599^th place

low place

ams.org

mathscinet.ams.org

Cobham, Alan (1969). "On the base-dependence of sets of numbers recognizable by finite automata". Mathematical Systems Theory. 3 (2): 186–192. doi:10.1007/BF01746527. MR 0250789.
Cobham, Alan (1972). "Uniform tag sequences". Mathematical Systems Theory. 6 (1–2): 164–192. doi:10.1007/BF01706087. MR 0457011.
Semenov, Alexei Lvovich (1977). "Predicates regular in two number systems are Presburger". Sib. Mat. Zh. (in Russian). 18: 403–418. doi:10.1007/BF00967164. MR 0450050. S2CID 119658350. Zbl 0369.02023.
Michel Rigo; Laurent Waxweiler (2006). "A Note on Syndeticity, Recognizable Sets and Cobham's Theorem" (PDF). Bulletin of the EATCS. 88: 169–173. arXiv:0907.0624. MR 2222340. Zbl 1169.68490. Retrieved 23 January 2017.

arxiv.org

Durand, Fabien (2011). "Cobham's theorem for substitutions". Journal of the European Mathematical Society. 13 (6): 1797–1812. arXiv:1010.4009. doi:10.4171/JEMS/294.
Michel Rigo; Laurent Waxweiler (2006). "A Note on Syndeticity, Recognizable Sets and Cobham's Theorem" (PDF). Bulletin of the EATCS. 88: 169–173. arXiv:0907.0624. MR 2222340. Zbl 1169.68490. Retrieved 23 January 2017.
Krebs, Thijmen J. P. (2021). "A More Reasonable Proof of Cobham's Theorem". International Journal of Foundations of Computer Science. 32 (2): 203207. arXiv:1801.06704. doi:10.1142/S0129054121500118. ISSN 0129-0541. S2CID 39850911.
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey; Stipulanti, Manon (2019). "Cobham's Theorem and Automaticity". International Journal of Foundations of Computer Science. 30 (8): 1363–1379. arXiv:1809.00679. doi:10.1142/S0129054119500308. ISSN 0129-0541. S2CID 52156852.

cnrs.fr

adamczewski.perso.math.cnrs.fr

Adamczewski, Boris; Bell, Jason (2010) [Chapter originally written 2010]. "Automata in number theory" (PDF). In Pin, J.-É. (ed.). Automata: from Mathematics to Applications. European Mathematical Society.

core.ac.uk

Muchnik (2003). "The definable criterion for definability in Presburger arithmetic and its applications" (PDF). Theoretical Computer Science. 290 (3): 1433–1444. doi:10.1016/S0304-3975(02)00047-6.

doi.org

Cobham, Alan (1969). "On the base-dependence of sets of numbers recognizable by finite automata". Mathematical Systems Theory. 3 (2): 186–192. doi:10.1007/BF01746527. MR 0250789.
Cobham, Alan (1972). "Uniform tag sequences". Mathematical Systems Theory. 6 (1–2): 164–192. doi:10.1007/BF01706087. MR 0457011.
Büchi, J. R. (1990). "Weak Second-Order Arithmetic and Finite Automata". The Collected Works of J. Richard Büchi. Z. Math. Logik Grundlagen Math. Vol. 6. p. 87. doi:10.1007/978-1-4613-8928-6_22. ISBN 978-1-4613-8930-9.
Durand, Fabien (2011). "Cobham's theorem for substitutions". Journal of the European Mathematical Society. 13 (6): 1797–1812. arXiv:1010.4009. doi:10.4171/JEMS/294.
Semenov, Alexei Lvovich (1977). "Predicates regular in two number systems are Presburger". Sib. Mat. Zh. (in Russian). 18: 403–418. doi:10.1007/BF00967164. MR 0450050. S2CID 119658350. Zbl 0369.02023.
Muchnik (2003). "The definable criterion for definability in Presburger arithmetic and its applications" (PDF). Theoretical Computer Science. 290 (3): 1433–1444. doi:10.1016/S0304-3975(02)00047-6.
Krebs, Thijmen J. P. (2021). "A More Reasonable Proof of Cobham's Theorem". International Journal of Foundations of Computer Science. 32 (2): 203207. arXiv:1801.06704. doi:10.1142/S0129054121500118. ISSN 0129-0541. S2CID 39850911.
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey; Stipulanti, Manon (2019). "Cobham's Theorem and Automaticity". International Journal of Foundations of Computer Science. 30 (8): 1363–1379. arXiv:1809.00679. doi:10.1142/S0129054119500308. ISSN 0129-0541. S2CID 52156852.

eatcs.org

Michel Rigo; Laurent Waxweiler (2006). "A Note on Syndeticity, Recognizable Sets and Cobham's Theorem" (PDF). Bulletin of the EATCS. 88: 169–173. arXiv:0907.0624. MR 2222340. Zbl 1169.68490. Retrieved 23 January 2017.

ems-ph.org

Durand, Fabien (2011). "Cobham's theorem for substitutions". Journal of the European Mathematical Society. 13 (6): 1797–1812. arXiv:1010.4009. doi:10.4171/JEMS/294.

ens-lyon.fr

perso.ens-lyon.fr

Paul Fermé, Willy Quach and Yassine Hamoudi (2015). "Le théorème de Cobham" [Cobham's Theorem] (PDF) (in French). Archived from the original (PDF) on 2017-02-02. Retrieved 24 January 2017.

semanticscholar.org

api.semanticscholar.org

Semenov, Alexei Lvovich (1977). "Predicates regular in two number systems are Presburger". Sib. Mat. Zh. (in Russian). 18: 403–418. doi:10.1007/BF00967164. MR 0450050. S2CID 119658350. Zbl 0369.02023.
Krebs, Thijmen J. P. (2021). "A More Reasonable Proof of Cobham's Theorem". International Journal of Foundations of Computer Science. 32 (2): 203207. arXiv:1801.06704. doi:10.1142/S0129054121500118. ISSN 0129-0541. S2CID 39850911.
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey; Stipulanti, Manon (2019). "Cobham's Theorem and Automaticity". International Journal of Foundations of Computer Science. 30 (8): 1363–1379. arXiv:1809.00679. doi:10.1142/S0129054119500308. ISSN 0129-0541. S2CID 52156852.

tucs.fi

Tomi Kärki (2005). "A Note on the Proof of Cobham's Theorem" (PDF). Rapport Technique n° 713. University of Turku. Retrieved 23 January 2017.

uc.pt

mat.uc.pt

Bruyère, Véronique (2010). "Around Cobham's theorem and some of its extensions". Dynamical Aspects of Automata and Semigroup Theories. Satellite Workshop of Highlights of AutoMathA. Retrieved 19 January 2017.

ujf-grenoble.fr

www-fourier.ujf-grenoble.fr

Durand, Fabien; Rigo, Michel (2010) [Chapter originally written 2010]. "On Cobham's Theorem" (PDF). In Pin, J.-É. (ed.). Automata: from Mathematics to Applications. European Mathematical Society.

uwaterloo.ca

cs.uwaterloo.ca

Shallit, Jeffrey; Allouche, Jean-Paul (31 March 2020). "Errata for Automatic Sequences: Theory, Applications, Generalizations" (PDF). Retrieved 25 June 2021.

web.archive.org

Paul Fermé, Willy Quach and Yassine Hamoudi (2015). "Le théorème de Cobham" [Cobham's Theorem] (PDF) (in French). Archived from the original (PDF) on 2017-02-02. Retrieved 24 January 2017.

wikipedia.org

fr.wikipedia.org

Allouche, Jean-Paul [in French]; Shallit, Jeffrey (2003). Automatic Sequences: theory, applications, generalizations. Cambridge: Cambridge University Press. p. 350. ISBN 0-521-82332-3.
Allouche, Jean-Paul [in French]; Shallit, Jeffrey (2003). Automatic Sequences: theory, applications, generalizations. Cambridge: Cambridge University Press. ISBN 0-521-82332-3.

worldcat.org

search.worldcat.org

Krebs, Thijmen J. P. (2021). "A More Reasonable Proof of Cobham's Theorem". International Journal of Foundations of Computer Science. 32 (2): 203207. arXiv:1801.06704. doi:10.1142/S0129054121500118. ISSN 0129-0541. S2CID 39850911.
Mol, Lucas; Rampersad, Narad; Shallit, Jeffrey; Stipulanti, Manon (2019). "Cobham's Theorem and Automaticity". International Journal of Foundations of Computer Science. 30 (8): 1363–1379. arXiv:1809.00679. doi:10.1142/S0129054119500308. ISSN 0129-0541. S2CID 52156852.

zbmath.org

Semenov, Alexei Lvovich (1977). "Predicates regular in two number systems are Presburger". Sib. Mat. Zh. (in Russian). 18: 403–418. doi:10.1007/BF00967164. MR 0450050. S2CID 119658350. Zbl 0369.02023.
Michel Rigo; Laurent Waxweiler (2006). "A Note on Syndeticity, Recognizable Sets and Cobham's Theorem" (PDF). Bulletin of the EATCS. 88: 169–173. arXiv:0907.0624. MR 2222340. Zbl 1169.68490. Retrieved 23 January 2017.