| 2023 | DLT | Fast Detection of Specific Fragments Against a Set of Sequences. | Marie-Pierre Bal, Maxime Crochemore |
| 2017 | CSR | Generalized Dyck Shifts. | Marie-Pierre Bal, Pavel Heller |
| 2015 | DLT | Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. | Marie-Pierre Bal, Pavel Heller |
| 2014 | ITA | Zeta functions of finite-type-Dyck shifts are N-algebraic. | Marie-Pierre Bal, Michel Blockelet, Catalin Dima |
| 2014 | MFCS | Sofic-Dyck Shifts. | Marie-Pierre Bal, Michel Blockelet, Catalin Dima |
| 2012 | DLT | Decidability of Geometricity of Regular Languages. | Marie-Pierre Bal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy |
| 2010 | CSR | Sofic and Almost of Finite Type Tree-Shifts. | Nathalie Aubrun, Marie-Pierre Bal |
| 2009 | DLT | A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. | Marie-Pierre Bal, Dominique Perrin |
| 2009 | ICALP | Decidability of Conjugacy of Tree-Shifts of Finite Type. | Nathalie Aubrun, Marie-Pierre Bal |
| 2008 | ISIT | Embeddings of local automata. | Marie-Pierre Bal, Sylvain Lombardy, Dominique Perrin |
| 2007 | DLT | Coding Partitions: Regularity, Maximality and Global Ambiguity. | Marie-Pierre Bal, Fabio Burderi, Antonio Restivo |
| 2007 | ISIT | Minimizing local automata. | Marie-Pierre Bal, Maxime Crochemore |
| 2006 | CSR | Conjugacy and Equivalence of Weighted Automata and Functional Transducers. | Marie-Pierre Bal, Sylvain Lombardy, Jacques Sakarovitch |
| 2006 | STACS | Complete Codes in a Sofic Shift. | Marie-Pierre Bal, Dominique Perrin |
| 2005 | ICALP | On the Equivalence of -Automata. | Marie-Pierre Bal, Sylvain Lombardy, Jacques Sakarovitch |
| 2004 | MFCS | A Hierarchy of Irreducible Sofic Shifts. | Marie-Pierre Bal, Francesca Fiorenzi, Dominique Perrin |
| 2004 | STACS | The Syntactic Graph of a Sofic Shift. | Marie-Pierre Bal, Francesca Fiorenzi, Dominique Perrin |
| 2002 | STACS | On the Enumerative Sequences of Regular Languages on k Symbols. | Marie-Pierre Bal, Dominique Perrin |
| 2000 | ICALP | Determinization of Transducers over Infinite Words. | Marie-Pierre Bal, Olivier Carton |
| 2000 | LATIN | Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. | Marie-Pierre Bal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch |
| 1999 | DLT | Asynchronous sliding block maps. | Marie-Pierre Bal, Olivier Carton |
| 1998 | LATIN | Super-State Automata and Rational Trees. | Frdrique Bassino, Marie-Pierre Bal, Dominique Perrin |
| 1997 | ICALP | Enumerative Sequences of Leaves in Rational Trees. | Frdrique Bassino, Marie-Pierre Bal, Dominique Perrin |
| 1996 | STACS | Cyclic Languages and Strongly Cyclic Languages. | Marie-Pierre Bal, Olivier Carton, Christophe Reutenauer |
| 1996 | STACS | Minimal Forbidden Words and Symbolic Dynamics. | Marie-Pierre Bal, Filippo Mignosi, Antonio Restivo |