An.A. Muchnik, “The definable criterion for definability in Presburger arithmetic and its applications”, Theoretical Computer Science, 290:3 (2003), 1433
Bernard Boigelot, “On iterating linear transformations over recognizable sets of integers”, Theoretical Computer Science, 309:1-3 (2003), 413
Christiane Frougny, “On multiplicatively dependent linear numeration systems, and periodic points”, RAIRO-Theor. Inf. Appl., 36:3 (2002), 293
Fabien Durand, Nonlinear Phenomena and Complex Systems, 7, Dynamics and Randomness, 2002, 53
Bernard Boigelot, Louis Latour, Lecture Notes in Computer Science, 2494, Implementation and Application of Automata, 2002, 40
Christiane Frougny, Lecture Notes in Computer Science, 2286, LATIN 2002: Theoretical Informatics, 2002, 64
Ivan Korec, “A list of arithmetical structures complete with respect to the first-order definability”, Theoretical Computer Science, 257:1-2 (2001), 115
Bernard Boigelot, Sébastien Jodogne, Pierre Wolper, Lecture Notes in Computer Science, 2083, Automated Reasoning, 2001, 611
Pierre Wolper, Constraint Databases, 2000, 305
Pierre Wolper, Bernard Boigelot, Lecture Notes in Computer Science, 1785, Tools and Algorithms for the Construction and Analysis of Systems, 2000, 1