Marie-Pierre Béal

81 papers A* 3A 5B 5C 7Misc 4Journal 51Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Checking and producing word attractors. CoRR Marie-Pierre Béal, Maxime Crochemore, Giuseppe Romana
2025	J	`jnl`	One-sided Hom shifts. CoRR Marie-Pierre Béal, Alexi Block Gorman
2025	—	`conf`	Specific Patterns Against Reference Sequences. From Strings to Graphs, and Back Again Marie-Pierre Béal, Maxime Crochemore
2024	J	`jnl`	Decidable problems in substitution shifts. J. Comput. Syst. Sci. Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2024	J	`jnl`	Unambiguously coded shifts. Eur. J. Comb. Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2023	C	`conf`	Fast Detection of Specific Fragments Against a Set of Sequences. DLT Marie-Pierre Béal, Maxime Crochemore
2023	J	`jnl`	Recognizability in S-adic shifts. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner
2022	J	`jnl`	Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. Marie-Pierre Béal, Maxime Crochemore
2022	J	`jnl`	Fast detection of specific fragments against a set of sequences. CoRR Marie-Pierre Béal, Maxime Crochemore
2021	J	`jnl`	Checking whether a word is Hamming-isometric in linear time. CoRR Marie-Pierre Béal, Maxime Crochemore
2021	J	`jnl`	Decidable problems in substitution shifts. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2021	J	`jnl`	Recognizability of morphisms. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2021	—	`ch.`	Symbolic dynamics. Handbook of Automata Theory (II.) Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
2021	J	`jnl`	Unambiguously coded systems. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2017	Misc	`conf`	Generalized Dyck Shifts. CSR Marie-Pierre Béal, Pavel Heller
2017	J	`jnl`	Shifts of k-nested sequences. Theor. Comput. Sci. Marie-Pierre Béal, Pavel Heller
2016	J	`jnl`	Sofic-Dyck shifts. Theor. Comput. Sci. Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2015	C	`conf`	Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. DLT Marie-Pierre Béal, Pavel Heller
2014	J	`jnl`	A quadratic algorithm for road coloring. Discret. Appl. Math. Marie-Pierre Béal, Dominique Perrin
2014	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Marie-Pierre Béal, Olivier Carton
2014	—	`conf`	Sofic-Dyck Shifts. MFCS (1) Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2014	J	`jnl`	Tree algebra of sofic tree languages. RAIRO Theor. Informatics Appl. Nathalie Aubrun, Marie-Pierre Béal
2014	Misc	`conf`	Zeta functions of finite-type-Dyck shifts are N-algebraic. ITA Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2013	C	`ed.`	Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings Developments in Language Theory Marie-Pierre Béal, Olivier Carton
2013	J	`jnl`	Finite-type-Dyck shift spaces. CoRR Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2013	J	`jnl`	Sofic Tree-Shifts. Theory Comput. Syst. Nathalie Aubrun, Marie-Pierre Béal
2013	J	`jnl`	Sofic-Dyck shifts. CoRR Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2012	C	`conf`	Decidability of Geometricity of Regular Languages. Developments in Language Theory Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy
2012	—	`conf`	Toward a Timed Theory of Channel Coding. FORMATS Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin
2012	J	`jnl`	Tree-shifts of finite type. Theor. Comput. Sci. Nathalie Aubrun, Marie-Pierre Béal
2011	J	`jnl`	A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin
2011	J	`jnl`	Periodic-Finite-Type Shift Spaces. IEEE Trans. Inf. Theory Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel
2010	Misc	`conf`	Sofic and Almost of Finite Type Tree-Shifts. CSR Nathalie Aubrun, Marie-Pierre Béal
2010	J	`jnl`	Symbolic dynamics CoRR Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
2009	C	`conf`	A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Developments in Language Theory Marie-Pierre Béal, Dominique Perrin
2009	J	`jnl`	Coding Partitions of Regular Sets. Int. J. Algebra Comput. Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
2009	J	`jnl`	Completing codes in a sofic shift. Theor. Comput. Sci. Marie-Pierre Béal, Dominique Perrin
2009	—	`conf`	Decidability of Conjugacy of Tree-Shifts of Finite Type. ICALP (1) Nathalie Aubrun, Marie-Pierre Béal
2008	J	`jnl`	A quadratic algorithm for road coloring CoRR Marie-Pierre Béal, Dominique Perrin
2008	B	`conf`	Embeddings of local automata. ISIT Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin
2008	J	`jnl`	Unambiguous Automata. Math. Comput. Sci. Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin
2007	C	`conf`	Coding Partitions: Regularity, Maximality and Global Ambiguity. Developments in Language Theory Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
2007	B	`conf`	Minimizing local automata. ISIT Marie-Pierre Béal, Maxime Crochemore
2006	J	`jnl`	Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. Marie-Pierre Béal, Dominique Perrin
2006	A	`conf`	Complete Codes in a Sofic Shift. STACS Marie-Pierre Béal, Dominique Perrin
2006	Misc	`conf`	Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
2006	J	`jnl`	The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence. Int. J. Algebra Comput. Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2005	J	`jnl`	A hierarchy of shift equivalent sofic shifts. Theor. Comput. Sci. Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2005	J	`jnl`	Codes and sofic constraints. Theor. Comput. Sci. Marie-Pierre Béal, Dominique Perrin
2005	J	`jnl`	Minimal Forbidden Patterns of Multi-Dimensional Shifts. Int. J. Algebra Comput. Marie-Pierre Béal, Francesca Fiorenzi, Filippo Mignosi
2005	A*	`conf`	On the Equivalence of -Automata. ICALP Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
2005	J	`jnl`	Presentations of constrained systems with unconstrained positions. IEEE Trans. Inf. Theory Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici
2004	B	`conf`	A Hierarchy of Irreducible Sofic Shifts. MFCS Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2004	J	`jnl`	An algorithmic view of gene teams. Theor. Comput. Sci. Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
2004	J	`jnl`	Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. Marie-Pierre Béal, Olivier Carton
2004	A	`conf`	The Syntactic Graph of a Sofic Shift. STACS Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2003	J	`jnl`	Computing forbidden words of regular languages. Fundam. Informaticae Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
2003	J	`jnl`	Extensions of the method of poles for code construction. IEEE Trans. Inf. Theory Marie-Pierre Béal
2003	J	`jnl`	On the generating sequences of regular languages on J. ACM Marie-Pierre Béal, Dominique Perrin
2003	J	`jnl`	Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
2002	J	`jnl`	A weak equivalence between shifts of finite type. Adv. Appl. Math. Marie-Pierre Béal, Dominique Perrin
2002	J	`jnl`	Determinization of transducers over finite and infinite words. Theor. Comput. Sci. Marie-Pierre Béal, Olivier Carton
2002	A	`conf`	On the Enumerative Sequences of Regular Languages on k Symbols. STACS Marie-Pierre Béal, Dominique Perrin
2000	J	`jnl`	A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
2000	J	`jnl`	Asynchronous sliding block maps. RAIRO Theor. Informatics Appl. Marie-Pierre Béal, Olivier Carton
2000	J	`jnl`	Computing the prefix of an automaton. RAIRO Theor. Informatics Appl. Marie-Pierre Béal, Olivier Carton
2000	A*	`conf`	Determinization of Transducers over Infinite Words. ICALP Marie-Pierre Béal, Olivier Carton
2000	J	`jnl`	Forbidden Words in Symbolic Dynamics. Adv. Appl. Math. Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
2000	B	`conf`	Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
1999	C	`conf`	Asynchronous sliding block maps. Developments in Language Theory Marie-Pierre Béal, Olivier Carton
1999	J	`jnl`	Enumerative Sequences of Leaves and Nodes in Rational Trees. Theor. Comput. Sci. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1998	J	`jnl`	On the Bound of the Synchronization Delay of a Local Automaton. Theor. Comput. Sci. Marie-Pierre Béal, Jean Senellart
1998	B	`conf`	Super-State Automata and Rational Trees. LATIN Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1997	A*	`conf`	Enumerative Sequences of Leaves in Rational Trees. ICALP Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1997	—	`ch.`	Symbolic Dynamics and Finite Automata. Handbook of Formal Languages (2) Marie-Pierre Béal, Dominique Perrin
1996	A	`conf`	Cyclic Languages and Strongly Cyclic Languages. STACS Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer
1996	A	`conf`	Minimal Forbidden Words and Symbolic Dynamics. STACS Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo
1995	J	`jnl`	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. Marie-Pierre Béal
1994	J	`jnl`	A note on the method of poles for code construction. IEEE Trans. Inf. Theory Jonathan J. Ashley, Marie-Pierre Béal
1990	J	`jnl`	The method of poles: A coding method for constrained channels. IEEE Trans. Inf. Theory Marie-Pierre Béal
1988	J	`jnl`	Codes Circulaires, Automates Locaux et Entropie. Theor. Comput. Sci. Marie-Pierre Béal