Codes Circulaires, Automates Locaux et Entropie. - Marie-Pierre Béal (Theor. Comput. Sci., 1988)

The method of poles: A coding method for constrained channels. - Marie-Pierre Béal (IEEE Trans. Inf. Theory, 1990)

A note on the method of poles for code construction. - Jonathan J. Ashley; Marie-Pierre Béal (IEEE Trans. Inf. Theory, 1994)

Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique. - Marie-Pierre Béal (RAIRO Theor. Informatics Appl., 1995)

Cyclic Languages and Strongly Cyclic Languages. - Marie-Pierre Béal; Olivier Carton; Christophe Reutenauer (STACS, 1996)

Minimal Forbidden Words and Symbolic Dynamics. - Marie-Pierre Béal; Filippo Mignosi; Antonio Restivo (STACS, 1996)

Enumerative Sequences of Leaves in Rational Trees. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (ICALP, 1997)

Symbolic Dynamics and Finite Automata. - Marie-Pierre Béal; Dominique Perrin (Handbook of Formal Languages (2), 1997)

Super-State Automata and Rational Trees. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (LATIN, 1998)

On the Bound of the Synchronization Delay of a Local Automaton. - Marie-Pierre Béal; Jean Senellart (Theor. Comput. Sci., 1998)

Enumerative Sequences of Leaves and Nodes in Rational Trees. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (Theor. Comput. Sci., 1999)

Determinization of Transducers over Infinite Words. - Marie-Pierre Béal; Olivier Carton (ICALP, 2000)

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. - Marie-Pierre Béal; Olivier Carton; Christophe Prieur 002; Jacques Sakarovitch (LATIN, 2000)

Forbidden Words in Symbolic Dynamics. - Marie-Pierre Béal; Filippo Mignosi; Antonio Restivo; Marinella Sciortino (Adv. Appl. Math., 2000)

Asynchronous sliding block maps. - Marie-Pierre Béal; Olivier Carton (RAIRO Theor. Informatics Appl., 2000)

Computing the prefix of an automaton. - Marie-Pierre Béal; Olivier Carton (RAIRO Theor. Informatics Appl., 2000)

A Finite State Version of the Kraft–McMillan Theorem. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (SIAM J. Comput., 2000)

On the Enumerative Sequences of Regular Languages on k Symbols. - Marie-Pierre Béal; Dominique Perrin (STACS, 2002)

A weak equivalence between shifts of finite type. - Marie-Pierre Béal; Dominique Perrin (Adv. Appl. Math., 2002)

Determinization of transducers over finite and infinite words. - Marie-Pierre Béal; Olivier Carton (Theor. Comput. Sci., 2002)

Computing forbidden words of regular languages. - Marie-Pierre Béal; Maxime Crochemore; Filippo Mignosi; Antonio Restivo; Marinella Sciortino (Fundam. Informaticae, 2003)

On the generating sequences of regular languages on k symbols. - Marie-Pierre Béal; Dominique Perrin (J. ACM, 2003)

Squaring transducers: an efficient procedure for deciding functionality and sequentiality. - Marie-Pierre Béal; Olivier Carton; Christophe Prieur 002; Jacques Sakarovitch (Theor. Comput. Sci., 2003)

Extensions of the method of poles for code construction. - Marie-Pierre Béal (IEEE Trans. Inf. Theory, 2003)

A Hierarchy of Irreducible Sofic Shifts. - Marie-Pierre Béal; Francesca Fiorenzi; Dominique Perrin (MFCS, 2004)

The Syntactic Graph of a Sofic Shift. - Marie-Pierre Béal; Francesca Fiorenzi; Dominique Perrin (STACS, 2004)

Determinization of Transducers over Infinite Words: The General Case. - Marie-Pierre Béal; Olivier Carton (Theory Comput. Syst., 2004)

An algorithmic view of gene teams. - Marie-Pierre Béal; Anne Bergeron; Sylvie Corteel; Mathieu Raffinot (Theor. Comput. Sci., 2004)

On the Equivalence of -Automata. - Marie-Pierre Béal; Sylvain Lombardy; Jacques Sakarovitch (ICALP, 2005)

Minimal Forbidden Patterns of Multi-Dimensional Shifts. - Marie-Pierre Béal; Francesca Fiorenzi; Filippo Mignosi (Int. J. Algebra Comput., 2005)

A hierarchy of shift equivalent sofic shifts. - Marie-Pierre Béal; Francesca Fiorenzi; Dominique Perrin (Theor. Comput. Sci., 2005)

Codes and sofic constraints. - Marie-Pierre Béal; Dominique Perrin (Theor. Comput. Sci., 2005)

Presentations of constrained systems with unconstrained positions. - Marie-Pierre Béal; Maxime Crochemore; Gabriele Fici (IEEE Trans. Inf. Theory, 2005)

Conjugacy and Equivalence of Weighted Automata and Functional Transducers. - Marie-Pierre Béal; Sylvain Lombardy; Jacques Sakarovitch (CSR, 2006)

Complete Codes in a Sofic Shift. - Marie-Pierre Béal; Dominique Perrin (STACS, 2006)

The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence. - Marie-Pierre Béal; Francesca Fiorenzi; Dominique Perrin (Int. J. Algebra Comput., 2006)

Codes, unambiguous automata and sofic systems. - Marie-Pierre Béal; Dominique Perrin (Theor. Comput. Sci., 2006)

Coding Partitions: Regularity, Maximality and Global Ambiguity. - Marie-Pierre Béal; Fabio Burderi; Antonio Restivo (Developments in Language Theory, 2007)

Minimizing local automata. - Marie-Pierre Béal; Maxime Crochemore (ISIT, 2007)

Embeddings of local automata. - Marie-Pierre Béal; Sylvain Lombardy; Dominique Perrin (ISIT, 2008)

Unambiguous Automata. - Marie-Pierre Béal; Eugen Czeizler; Jarkko Kari; Dominique Perrin (Math. Comput. Sci., 2008)

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. - Marie-Pierre Béal; Dominique Perrin (Developments in Language Theory, 2009)

Decidability of Conjugacy of Tree-Shifts of Finite Type. - Nathalie Aubrun; Marie-Pierre Béal (ICALP (1), 2009)

Coding Partitions of Regular Sets. - Marie-Pierre Béal; Fabio Burderi; Antonio Restivo (Int. J. Algebra Comput., 2009)

Completing codes in a sofic shift. - Marie-Pierre Béal; Dominique Perrin (Theor. Comput. Sci., 2009)

Sofic and Almost of Finite Type Tree-Shifts. - Nathalie Aubrun; Marie-Pierre Béal (CSR, 2010)

Symbolic dynamics - Marie-Pierre Béal; Jean Berstel; Søren Eilers; Dominique Perrin (CoRR, 2010)

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. - Marie-Pierre Béal; Mikhail V. Berlinkov; Dominique Perrin (Int. J. Found. Comput. Sci., 2011)

Periodic-Finite-Type Shift Spaces. - Marie-Pierre Béal; Maxime Crochemore; Bruce E. Moision; Paul H. Siegel (IEEE Trans. Inf. Theory, 2011)

Decidability of Geometricity of Regular Languages. - Marie-Pierre Béal; Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne; Sylvain Lombardy (Developments in Language Theory, 2012)

Toward a Timed Theory of Channel Coding. - Eugene Asarin; Nicolas Basset; Marie-Pierre Béal; Aldric Degorre; Dominique Perrin (FORMATS, 2012)

Tree-shifts of finite type. - Nathalie Aubrun; Marie-Pierre Béal (Theor. Comput. Sci., 2012)

Finite-type-Dyck shift spaces. - Marie-Pierre Béal; Michel Blockelet; Catalin Dima (CoRR, 2013)

Sofic Tree-Shifts. - Nathalie Aubrun; Marie-Pierre Béal (Theory Comput. Syst., 2013)

Zeta functions of finite-type-Dyck shifts are N-algebraic. - Marie-Pierre Béal; Michel Blockelet; Catalin Dima (ITA, 2014)

A quadratic algorithm for road coloring. - Marie-Pierre Béal; Dominique Perrin (Discret. Appl. Math., 2014)

Preface. - Marie-Pierre Béal; Olivier Carton (Int. J. Found. Comput. Sci., 2014)

Tree algebra of sofic tree languages. - Nathalie Aubrun; Marie-Pierre Béal (RAIRO Theor. Informatics Appl., 2014)

Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. - Marie-Pierre Béal; Pavel Heller (DLT, 2015)

Sofic-Dyck shifts. - Marie-Pierre Béal; Michel Blockelet; Catalin Dima (Theor. Comput. Sci., 2016)

Generalized Dyck Shifts. - Marie-Pierre Béal; Pavel Heller (CSR, 2017)

Shifts of k-nested sequences. - Marie-Pierre Béal; Pavel Heller (Theor. Comput. Sci., 2017)

Symbolic dynamics. - Marie-Pierre Béal; Jean Berstel; Søren Eilers; Dominique Perrin (Handbook of Automata Theory (II.), 2021)

Unambiguously coded systems. - Marie-Pierre Béal; Dominique Perrin; Antonio Restivo (CoRR, 2021)

Recognizability of morphisms. - Marie-Pierre Béal; Dominique Perrin; Antonio Restivo (CoRR, 2021)

Checking whether a word is Hamming-isometric in linear time. - Marie-Pierre Béal; Maxime Crochemore (Theor. Comput. Sci., 2022)

Fast Detection of Specific Fragments Against a Set of Sequences. - Marie-Pierre Béal; Maxime Crochemore (DLT, 2023)

Recognizability in S-adic shifts. - Marie-Pierre Béal; Dominique Perrin; Antonio Restivo; Wolfgang Steiner (CoRR, 2023)

Unambiguously coded shifts. - Marie-Pierre Béal; Dominique Perrin; Antonio Restivo (Eur. J. Comb., 2024)

Decidable problems in substitution shifts. - Marie-Pierre Béal; Dominique Perrin; Antonio Restivo (J. Comput. Syst. Sci., 2024)

Specific Patterns Against Reference Sequences. - Marie-Pierre Béal; Maxime Crochemore (From Strings to Graphs, and Back Again, 2025)