F. Durand, “Cobham–Semenov theorem and Nd-subshifts”, Theoretical Computer Science, 391:1-2 (2008), 20
Felix Klaedtke, “Bounds on the automata size for Presburger arithmetic”, ACM Trans. Comput. Logic, 9:2 (2008), 1
María Isabel Cortez, Fabien Durand, “Self-Similar Tiling Systems, Topological Factors and Stretching Factors”, Discrete Comput Geom, 40:4 (2008), 622
S. I. Adian, A. L. Semenov, V. A. Uspenskii, “Andrei Al'bertovich Muchnik (obituary)”, Russian Math. Surveys, 62:4 (2007), 775–779
Bernard Boigelot, Julien Brusten, Lecture Notes in Computer Science, 4596, Automata, Languages and Programming, 2007, 813
JUHA HONKALA, “THE BASE PROBLEM FOR D0L PARIKH SETS”, Int. J. Found. Comput. Sci., 17:02 (2006), 465
Bernard Boigelot, Sébastien Jodogne, Pierre Wolper, “An effective decision procedure for linear arithmetic over the integers and reals”, ACM Trans. Comput. Logic, 6:3 (2005), 614
J. Leroux, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005, 147
L. Latour, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004, 120
Bernard Boigelot, Louis Latour, “Counting the solutions of Presburger equations without enumerating them”, Theoretical Computer Science, 313:1 (2004), 17