On Pascal Triangles Modulo a Prime Power. - Alexis Bès (Ann. Pure Appl. Log., 1997)

Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem. - Alexis Bès (J. Symb. Log., 1997)

Undecidable Extensions of Skolem Arithmetic. - Alexis Bès; Denis Richard (J. Symb. Log., 1998)

An Extension of The Cobham-Semënov Theorem. - Alexis Bès (J. Symb. Log., 2000)

Temporal Tableau Queries. - Jef Wijsen; Alexis Bès (TIME, 2001)

On query optimization in a temporal SPC algebra. - Jef Wijsen; Alexis Bès (Data Knowl. Eng., 2003)

A Kleene Theorem for Languages of Words Indexed by Linear Orderings. - Alexis Bès; Olivier Carton (Int. J. Found. Comput. Sci., 2006)

Weakly maximal decidable structures. - Alexis Bès; Patrick Cégielski (RAIRO Theor. Informatics Appl., 2008)

An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. - Alexis Bès (Log. Methods Comput. Sci., 2008)

Logic and Rational Languages of Words Indexed by Linear Orderings. - Nicolas Bedon; Alexis Bès; Olivier Carton; Chloe Rispal (Theory Comput. Syst., 2010)

Algebraic Characterization of FO for Scattered Linear Orderings. - Alexis Bès; Olivier Carton (CSL, 2011)

Decidable Expansions of Labelled Linear Orderings - Alexis Bès; Alexander Rabinovich (Log. Methods Comput. Sci., 2011)

On countable chains having decidable monadic theory. - Alexis Bès; Alexander Rabinovich (J. Symb. Log., 2012)

Expansions of MSO by cardinality relations. - Alexis Bès (Log. Methods Comput. Sci., 2013)

Complexity and (un)decidability of fragments of 〈 ωωλ; × 〉. - Alexis Bès; Christian Choffrut (CoRR, 2018)

Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. - Alexis Bès; Christian Choffrut (CoRR, 2018)

Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉. - Alexis Bès; Christian Choffrut (Fundam. Informaticae, 2019)

$ langle mathbb {R}, +, <, 1 rangle $ Is Decidable in $ langle mathbb {R}, +, < , mathbb {Z} rangle $. - Alexis Bès; Christian Choffrut (LATA, 2020)

Theories of real addition with and without a predicate for integers. - Alexis Bès; Christian Choffrut (Log. Methods Comput. Sci., 2021)

Decidability of Definability Issues in the Theory of Real Addition. - Alexis Bès; Christian Choffrut (Fundam. Informaticae, 2022)