@article(Alexeev:2004,
 author       = {Boris Alexeev},
 year         = {2004},
 title        = {Minimal {DFA} for testing divisibility},
 journal      = {J. Comput. System Sci.},
 volume       = {69},
 number       = {2},
 pages        = {235--243},
 doi          = {10.1016/j.jcss.2004.02.001},
)
@article(Allouche:2015,
 author       = {Jean-Paul Allouche},
 year         = {2015},
 title        = {Thue, Combinatorics on words, and conjectures inspired by the Thue-Morse sequence},
 journal      = {Journal de Th\IeC{\'e}orie des Nombres de Bordeaux},
 volume       = {27},
 pages        = {375--388},
 doi          = {10.5802/jtnb.906},
)
@article(Allouche&Rampersad&Shallit:2009,
 author       = {Jean-Paul Allouche and Narad Rampersad and Jeffrey Shallit},
 year         = {2009},
 title        = {Periodicity, repetitions, and orbits of an automatic sequence},
 journal      = {Theoret. Comput. Sci.},
 volume       = {410},
 number       = {30-32},
 pages        = {2795--2803},
 doi          = {10.1016/j.tcs.2009.02.006},
)
@article(Allouche&Shallit:1992,
 author       = {Jean-Paul Allouche and Jeffrey Shallit},
 year         = {1992},
 title        = {The ring of {$k$}-regular sequences},
 journal      = {Theoret. Comput. Sci.},
 volume       = {98},
 number       = {2},
 pages        = {163--197},
 doi          = {10.1016/S0304-3975(03)00090-2},
)
@book(Allouche&Shallit:2003,
 author       = {Jean-Paul Allouche and Jeffrey Shallit},
 year         = {2003},
 title        = {Automatic sequences},
 publisher    = {Cambridge University Press, Cambridge},
 doi          = {10.1017/CBO9780511546563},
 note         = {Theory, applications, generalizations},
)
@incollection(BMMR,
 author       = {Bernard Boigelot and Isabelle Mainz and Victor Marsault and Michel Rigo},
 year         = {2017},
 title        = {An efficient algorithm to decide periodicity of {$b$}-recognisable sets using {MSDF} convention},
 booktitle    = {44th {I}nternational {C}olloquium on {A}utomata, {L}anguages, and {P}rogramming},
 series       = {LIPIcs. Leibniz Int. Proc. Inform.},
 volume       = {80},
 publisher    = {Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern},
 pages        = {Art. No. 118, 14},
 doi          = {10.4230/LIPIcs.ICALP.2017.118},
)
@incollection(Boigelot&Rassart&Wolper:1998,
 author       = {Bernard Boigelot and St{\'e}phane Rassart and Pierre Wolper},
 year         = {1998},
 title        = {On the expressiveness of real and integer arithmetic automata (extended abstract)},
 booktitle    = {ICALP},
 series       = {Lecture Notes in Comput. Sci.},
 volume       = {1443},
 publisher    = {Springer, Berlin},
 pages        = {152--163},
 doi          = {10.1007/BFb0055049},
)
@article(Bruyere&Hansel:1997,
 author       = {V\'{e}ronique Bruy\`ere and Georges Hansel},
 year         = {1997},
 title        = {Bertrand numeration systems and recognizability},
 journal      = {Theoret. Comput. Sci.},
 volume       = {181},
 number       = {1},
 pages        = {17--43},
 doi          = {10.1016/S0304-3975(96)00260-5},
 note         = {Latin American Theoretical INformatics (Valpara\'{\i}so, 1995)},
)
@article(Bruyere&Hansel&Michaux&Villemaire:1994,
 author       = {V\'{e}ronique Bruy{\`e}re and Georges Hansel and Christian Michaux and Roger Villemaire},
 year         = {1994},
 title        = {Logic and {$p$}-Recognizable Sets of Integers},
 journal      = {Bull. Belg. Math. Soc. Simon Stevin},
 volume       = {1},
 number       = {2},
 pages        = {191--238},
 note         = {Journ{\'e}es Montoises (Mons, 1992)},
)
@incollection(Charlier:2018,
 author       = {\'{E}milie Charlier},
 year         = {2018},
 title        = {First-order logic and numeration systems},
 booktitle    = {Sequences, groups, and number theory},
 series       = {Trends Math.},
 publisher    = {Birkh\"{a}user/Springer, Cham},
 pages        = {89--141},
 doi          = {10.1016/0022-0000(83)90051-X},
)
@unpublished(arxiv-version,
 author       = {{\'E}milie Charlier and C\'{e}lia Cisternino and Adeline Massuir},
 year         = {2019},
 title        = {State complexity of the multiples of the Thue-Morse set},
 url          = {https://arxiv.org/abs/1903.06114},
 note         = {Full version},
)
@article(Charlier&Leroy&Rigo:2015,
 author       = {\'{E}milie Charlier and Julien Leroy and Michel Rigo},
 year         = {2015},
 title        = {An analogue of {C}obham's theorem for graph directed iterated function systems},
 journal      = {Adv. Math.},
 volume       = {280},
 pages        = {86--120},
 doi          = {10.1016/j.aim.2015.04.008},
)
@article(Charlier&Rampersad:2011,
 author       = {\'{E}milie Charlier and Narad Rampersad},
 year         = {2011},
 title        = {The growth function of {$S$}-recognizable sets},
 journal      = {Theoret. Comput. Sci.},
 volume       = {412},
 number       = {39},
 pages        = {5400--5408},
 doi          = {10.1016/j.tcs.2011.05.057},
)
@article(Charlier&Rampersad&Rigo&Waxweiler:2011,
 author       = {\'{E}milie Charlier and Narad Rampersad and Michel Rigo and Laurent Waxweiler},
 year         = {2011},
 title        = {The minimal automaton recognizing {$m\mathbb{N}$} in a linear numeration system},
 journal      = {Integers},
 volume       = {11B},
 pages        = {Paper No. A4, 24},
)
@article(Charlier&Rampersad&Shallit:2012,
 author       = {\'{E}milie Charlier and Narad Rampersad and Jeffrey Shallit},
 year         = {2012},
 title        = {Enumeration and decidable properties of automatic sequences},
 journal      = {Internat. J. Found. Comput. Sci.},
 volume       = {23},
 number       = {5},
 pages        = {1035--1066},
 doi          = {10.1142/S0129054112400448},
)
@article(Cobham:1969,
 author       = {Alan Cobham},
 year         = {1969},
 title        = {On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata},
 journal      = {Math. Systems Theory},
 volume       = {3},
 pages        = {186--192},
 doi          = {10.1007/BF01746527},
)
@article(Cobham:1972,
 author       = {Alan Cobham},
 year         = {1972},
 title        = {Uniform tag sequences},
 journal      = {Math. Systems Theory},
 volume       = {6},
 doi          = {10.1007/BF01706087},
)
@article(Durand:2013,
 author       = {Fabien Durand},
 year         = {2013},
 title        = {Decidability of the {HD}0{L} ultimate periodicity problem},
 journal      = {RAIRO Theor. Inform. Appl.},
 volume       = {47},
 number       = {2},
 pages        = {201--214},
 doi          = {10.1051/ita/2013035},
)
@book(Eilenberg:1974,
 author       = {Samuel Eilenberg},
 year         = {1974},
 title        = {Automata, languages, and machines. {V}ol. {A}},
 publisher    = {Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], New York},
 note         = {Pure and Applied Mathematics, Vol. 58},
)
@article(Frougny:1992,
 author       = {Christiane Frougny},
 year         = {1992},
 title        = {Representations of numbers and finite automata},
 journal      = {Math. Systems Theory},
 volume       = {25},
 number       = {1},
 pages        = {37--60},
 doi          = {10.1007/BF01368783},
)
@incollection(Frougny&Sakarovitch:2010,
 author       = {Christiane Frougny and Jacques Sakarovitch},
 year         = {2010},
 title        = {Number representation and finite automata},
 booktitle    = {Combinatorics, automata and number theory},
 series       = {Encyclopedia Math. Appl.},
 volume       = {135},
 publisher    = {Cambridge Univ. Press, Cambridge},
 pages        = {34--107},
 doi          = {10.1017/CBO9780511777653.003},
)
@article(Honkala:1986,
 author       = {Juha Honkala},
 year         = {1986},
 title        = {A decision method for the recognizability of sets defined by number systems},
 journal      = {RAIRO Inform. Th\'{e}or. Appl.},
 volume       = {20},
 number       = {4},
 pages        = {395--403},
 doi          = {10.1051/ita/1986200403951},
)
@incollection(Hopcroft:1971,
 author       = {John Hopcroft},
 year         = {1971},
 title        = {An {$n$} log {$n$} algorithm for minimizing states in a finite automaton},
 booktitle    = {Theory of machines and computations ({P}roc. {I}nternat. {S}ympos., {T}echnion, {H}aifa, 1971)},
 publisher    = {Academic Press, New York},
 pages        = {189--196},
 doi          = {10.1016/B978-0-12-417750-5.50022-1},
)
@unpublished(Hopcroft&Karp:2015,
 author       = {John Hopcroft and Richard Karp},
 year         = {1971},
 title        = {A linear algorithm for testing equivalence of finite automata},
 note         = {Technical Report 71\IeC{\textendash}114, University of California},
)
@incollection(Leroux:2005,
 author       = {J{\'e}r{\^o}me Leroux},
 year         = {2005},
 title        = {A polynomial time {P}resburger criterion and synthesis for number decision diagrams},
 booktitle    = {20th IEEE Symposium on Logic in Computer Science},
 publisher    = {IEEE Computer Society, Chicago, IL, USA},
 pages        = {147--156},
 doi          = {10.1109/LICS.2005.2},
)
@book(Lothaire1997,
 author       = {M.~Lothaire},
 year         = {1997},
 title        = {Combinatorics on words},
 series       = {Cambridge Mathematical Library},
 publisher    = {Cambridge University Press, Cambridge},
 doi          = {10.1017/CBO9780511566097},
)
@incollection(Marsault&Sakarovitch:2013,
 author       = {Victor Marsault and Jacques Sakarovitch},
 year         = {2013},
 title        = {Ultimate periodicity of b-recognisable sets: a quasilinear procedure},
 booktitle    = {Developments in language theory},
 series       = {Lecture Notes in Comput. Sci.},
 volume       = {7907},
 publisher    = {Springer, Heidelberg},
 pages        = {362--373},
 doi          = {10.1007/978-3-642-38771-5\_32},
)
@article(Mitrofanov:2013,
 author       = {Ivan~V. Mitrofanov},
 year         = {2013},
 title        = {Periodicity of morphic words},
 journal      = {Fundam. Prikl. Mat.},
 volume       = {18},
 number       = {4},
 pages        = {107--119},
)
@unpublished(Mousavi:2015,
 author       = {Hamoon Mousavi},
 year         = {2015},
 title        = {{\tt Walnut}},
 url          = {https://cs.uwaterloo.ca/~shallit/papers.html},
)
@article(Muchnik:2003,
 author       = {Andre{\u{\i}}~A. Muchnik},
 year         = {2003},
 title        = {The definable criterion for definability in {P}resburger arithmetic and its applications},
 journal      = {Theoret. Comput. Sci.},
 volume       = {290},
 number       = {3},
 pages        = {1433--1444},
 doi          = {10.1016/S0304-3975(02)00047-6},
)
@book(Rigo:2014,
 author       = {Michel Rigo},
 year         = {2014},
 title        = {Formal languages, automata and numeration systems. 2},
 series       = {Networks and Telecommunications Series},
 publisher    = {ISTE, London; John Wiley \& Sons, Inc., Hoboken, NJ},
 note         = {Applications to recognizability and decidability, With a foreword by Val\'erie Berth\'e},
)
@book(Sakarovitch2009,
 author       = {Jacques Sakarovitch},
 year         = {2009},
 title        = {Elements of automata theory},
 publisher    = {Cambridge University Press, Cambridge},
 doi          = {10.1017/CBO9781139195218},
 note         = {Translated from the 2003 French original by Reuben Thomas},
)
@article(Shallit:2015,
 author       = {Jeffrey Shallit},
 year         = {2015},
 title        = {Enumeration and automatic sequences},
 journal      = {Pure Math. Appl. (PU.M.A.)},
 volume       = {25},
 number       = {1},
 pages        = {96--106},
)
@phdthesis(Waxweiler2009,
 author       = {Laurent Waxweiler},
 year         = {2009},
 title        = {Caract{\`e}re reconnaissable d'ensembles de polyn{\^o}mes {\`a} coefficients dans un corps fini},
 school       = {University of Li{\`e}ge},
 address      = {Belgium},
)