Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. - Mathieu Caralp; Pierre-Alain Reynier; Jean-Marc Talbot (Developments in Language Theory, 2012)

Expressiveness of Visibly Pushdown Transducers. - Mathieu Caralp; Emmanuel Filiot; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (TTATT, 2013)

Cellular Programming. - Peter Niebert; Mathieu Caralp (TPNC, 2014)

Trimming visibly pushdown automata. - Mathieu Caralp; Pierre-Alain Reynier; Jean-Marc Talbot (Theor. Comput. Sci., 2015)