Marie-Pierre Béal

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 13

Top Topics

Consistency Checking

Problems Involving

Manifold Learning

Word Recognition

Top Venues

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Publications

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Unambiguously coded shifts. Eur. J. Comb. 119 (2024)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Decidable problems in substitution shifts. J. Comput. Syst. Sci. 143 (2024)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner
Recognizability in S-adic shifts. CoRR (2023)
Marie-Pierre Béal, Maxime Crochemore
Fast Detection of Specific Fragments Against a Set of Sequences. DLT (2023)
Marie-Pierre Béal, Maxime Crochemore
Fast detection of specific fragments against a set of sequences. CoRR (2022)
Marie-Pierre Béal, Maxime Crochemore
Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933 (2022)
Marie-Pierre Béal, Maxime Crochemore
Checking whether a word is Hamming-isometric in linear time. CoRR (2021)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Recognizability of morphisms. CoRR (2021)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Unambiguously coded systems. CoRR (2021)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Decidable problems in substitution shifts. CoRR (2021)
Marie-Pierre Béal, Pavel Heller
Shifts of k-nested sequences. Theor. Comput. Sci. 658 (2017)
Marie-Pierre Béal, Pavel Heller
Generalized Dyck Shifts. CSR (2017)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck shifts. Theor. Comput. Sci. 609 (2016)
Marie-Pierre Béal, Pavel Heller
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. DLT (2015)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Zeta functions of finite-type-Dyck shifts are N-algebraic. ITA (2014)
Marie-Pierre Béal, Dominique Perrin
A quadratic algorithm for road coloring. Discret. Appl. Math. 169 (2014)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck Shifts. MFCS (1) (2014)
Marie-Pierre Béal, Olivier Carton
Preface. Int. J. Found. Comput. Sci. 25 (8) (2014)
Nathalie Aubrun, Marie-Pierre Béal
Tree algebra of sofic tree languages. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Finite-type-Dyck shift spaces. CoRR (2013)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck shifts. CoRR (2013)
Nathalie Aubrun, Marie-Pierre Béal
Sofic Tree-Shifts. Theory Comput. Syst. 53 (4) (2013)
Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin
Toward a Timed Theory of Channel Coding. FORMATS (2012)
Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy
Decidability of Geometricity of Regular Languages. Developments in Language Theory (2012)
Nathalie Aubrun, Marie-Pierre Béal
Tree-shifts of finite type. Theor. Comput. Sci. 459 (2012)
Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. 22 (2) (2011)
Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel
Periodic-Finite-Type Shift Spaces. IEEE Trans. Inf. Theory 57 (6) (2011)
Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
Symbolic dynamics CoRR (2010)
Nathalie Aubrun, Marie-Pierre Béal
Sofic and Almost of Finite Type Tree-Shifts. CSR (2010)
Marie-Pierre Béal, Dominique Perrin
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Developments in Language Theory (2009)
Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
Coding Partitions of Regular Sets. Int. J. Algebra Comput. 19 (8) (2009)
Nathalie Aubrun, Marie-Pierre Béal
Decidability of Conjugacy of Tree-Shifts of Finite Type. ICALP (1) (2009)
Marie-Pierre Béal, Dominique Perrin
Completing codes in a sofic shift. Theor. Comput. Sci. 410 (43) (2009)
Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin
Embeddings of local automata. ISIT (2008)
Marie-Pierre Béal, Dominique Perrin
A quadratic algorithm for road coloring CoRR (2008)
Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin
Unambiguous Automata. Math. Comput. Sci. 1 (4) (2008)
Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
Coding Partitions: Regularity, Maximality and Global Ambiguity. Developments in Language Theory (2007)
Marie-Pierre Béal, Maxime Crochemore
Minimizing local automata. ISIT (2007)
Marie-Pierre Béal, Dominique Perrin
Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. 356 (1-2) (2006)
Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR (2006)
Marie-Pierre Béal, Dominique Perrin
Complete Codes in a Sofic Shift. STACS (2006)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence. Int. J. Algebra Comput. 16 (3) (2006)
Marie-Pierre Béal, Dominique Perrin
Codes and sofic constraints. Theor. Comput. Sci. 340 (1) (2005)
Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
On the Equivalence of -Automata. ICALP (2005)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
A hierarchy of shift equivalent sofic shifts. Theor. Comput. Sci. 345 (2-3) (2005)
Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici
Presentations of constrained systems with unconstrained positions. IEEE Trans. Inf. Theory 51 (5) (2005)
Marie-Pierre Béal, Francesca Fiorenzi, Filippo Mignosi
Minimal Forbidden Patterns of Multi-Dimensional Shifts. Int. J. Algebra Comput. 15 (1) (2005)
Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
An algorithmic view of gene teams. Theor. Comput. Sci. 320 (2-3) (2004)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
The Syntactic Graph of a Sofic Shift. STACS (2004)
Marie-Pierre Béal, Olivier Carton
Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. 37 (4) (2004)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
A Hierarchy of Irreducible Sofic Shifts. MFCS (2004)
Marie-Pierre Béal, Dominique Perrin
symbols. J. ACM 50 (6) (2003)
Marie-Pierre Béal
Extensions of the method of poles for code construction. IEEE Trans. Inf. Theory 49 (6) (2003)
Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
Computing forbidden words of regular languages. Fundam. Informaticae 56 (1-2) (2003)
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292 (1) (2003)
Marie-Pierre Béal, Olivier Carton
Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289 (1) (2002)
Marie-Pierre Béal, Dominique Perrin
On the Enumerative Sequences of Regular Languages on k Symbols. STACS (2002)
Marie-Pierre Béal, Dominique Perrin
A weak equivalence between shifts of finite type. Adv. Appl. Math. 29 (2) (2002)
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN (2000)
Marie-Pierre Béal, Olivier Carton
Computing the prefix of an automaton. RAIRO Theor. Informatics Appl. 34 (6) (2000)
Marie-Pierre Béal, Olivier Carton
Asynchronous sliding block maps. RAIRO Theor. Informatics Appl. 34 (2) (2000)
Marie-Pierre Béal, Olivier Carton
Determinization of Transducers over Infinite Words. ICALP (2000)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. 30 (4) (2000)
Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
Forbidden Words in Symbolic Dynamics. Adv. Appl. Math. 25 (2) (2000)
Marie-Pierre Béal, Olivier Carton
Asynchronous sliding block maps. Developments in Language Theory (1999)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Enumerative Sequences of Leaves and Nodes in Rational Trees. Theor. Comput. Sci. 221 (1-2) (1999)
Marie-Pierre Béal, Jean Senellart
On the Bound of the Synchronization Delay of a Local Automaton. Theor. Comput. Sci. 205 (1-2) (1998)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Super-State Automata and Rational Trees. LATIN (1998)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Enumerative Sequences of Leaves in Rational Trees. ICALP (1997)
Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo
Minimal Forbidden Words and Symbolic Dynamics. STACS (1996)
Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer
Cyclic Languages and Strongly Cyclic Languages. STACS (1996)
Marie-Pierre Béal
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique. RAIRO Theor. Informatics Appl. 29 (2) (1995)
Jonathan J. Ashley, Marie-Pierre Béal
A note on the method of poles for code construction. IEEE Trans. Inf. Theory 40 (2) (1994)
Marie-Pierre Béal
The method of poles: A coding method for constrained channels. IEEE Trans. Inf. Theory 36 (4) (1990)
Marie-Pierre Béal
Codes Circulaires, Automates Locaux et Entropie. Theor. Comput. Sci. 57 (1988)