Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarie-Pierre Béal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Marie-Pierre Béal
, Dominique Perrin, Antonio Restivo:
Unambiguously coded shifts. Eur. J. Comb. 119: 103812 (2024)- [j38]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Decidable problems in substitution shifts. J. Comput. Syst. Sci. 143: 103529 (2024) - 2023
- [c26]Marie-Pierre Béal, Maxime Crochemore:
Fast Detection of Specific Fragments Against a Set of Sequences. DLT 2023: 51-60 - [i10]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner:
Recognizability in S-adic shifts. CoRR abs/2302.06258 (2023) - 2022
- [j37]Marie-Pierre Béal, Maxime Crochemore:
Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933: 55-59 (2022) - [i9]Marie-Pierre Béal, Maxime Crochemore:
Fast detection of specific fragments against a set of sequences. CoRR abs/2208.03451 (2022) - 2021
- [p2]Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. Handbook of Automata Theory (II.) 2021: 987-1030 - [i8]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Unambiguously coded systems. CoRR abs/2103.01012 (2021) - [i7]Marie-Pierre Béal, Maxime Crochemore:
Checking whether a word is Hamming-isometric in linear time. CoRR abs/2106.10541 (2021) - [i6]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Recognizability of morphisms. CoRR abs/2110.10267 (2021) - [i5]Marie-Pierre Béal, Dominique Perrin, Antonio Restivo:
Decidable problems in substitution shifts. CoRR abs/2112.14499 (2021)
2010 – 2019
- 2017
- [j36]Marie-Pierre Béal, Pavel Heller:
Shifts of k-nested sequences. Theor. Comput. Sci. 658: 18-26 (2017) - [c25]Marie-Pierre Béal, Pavel Heller:
Generalized Dyck Shifts. CSR 2017: 99-111 - 2016
- [j35]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck shifts. Theor. Comput. Sci. 609: 226-244 (2016) - 2015
- [c24]Marie-Pierre Béal, Pavel Heller:
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. DLT 2015: 167-178 - 2014
- [j34]Marie-Pierre Béal, Dominique Perrin:
A quadratic algorithm for road coloring. Discret. Appl. Math. 169: 15-29 (2014) - [j33]Marie-Pierre Béal, Olivier Carton:
Preface. Int. J. Found. Comput. Sci. 25(8): 933-936 (2014) - [j32]Nathalie Aubrun, Marie-Pierre Béal:
Tree algebra of sofic tree languages. RAIRO Theor. Informatics Appl. 48(4): 431-451 (2014) - [c23]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Zeta functions of finite-type-Dyck shifts are N-algebraic. ITA 2014: 1-8 - [c22]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck Shifts. MFCS (1) 2014: 63-74 - 2013
- [j31]Nathalie Aubrun, Marie-Pierre Béal:
Sofic Tree-Shifts. Theory Comput. Syst. 53(4): 621-644 (2013) - [e1]Marie-Pierre Béal, Olivier Carton:
Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings. Lecture Notes in Computer Science 7907, Springer 2013, ISBN 978-3-642-38770-8 [contents] - [i4]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck shifts. CoRR abs/1305.7413 (2013) - [i3]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Finite-type-Dyck shift spaces. CoRR abs/1311.4223 (2013) - 2012
- [j30]Nathalie Aubrun, Marie-Pierre Béal:
Tree-shifts of finite type. Theor. Comput. Sci. 459: 16-25 (2012) - [c21]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: 62-72 - [c20]Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin:
Toward a Timed Theory of Channel Coding. FORMATS 2012: 27-42 - 2011
- [j29]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): 277-288 (2011) - [j28]Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel:
Periodic-Finite-Type Shift Spaces. IEEE Trans. Inf. Theory 57(6): 3677-3691 (2011) - 2010
- [c19]Nathalie Aubrun, Marie-Pierre Béal:
Sofic and Almost of Finite Type Tree-Shifts. CSR 2010: 12-24 - [i2]Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. CoRR abs/1006.1265 (2010)
2000 – 2009
- 2009
- [j27]Marie-Pierre Béal, Fabio Burderi, Antonio Restivo:
Coding Partitions of Regular Sets. Int. J. Algebra Comput. 19(8): 1011-1023 (2009) - [j26]Marie-Pierre Béal, Dominique Perrin:
Completing codes in a sofic shift. Theor. Comput. Sci. 410(43): 4423-4431 (2009) - [c18]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: 81-90 - [c17]Nathalie Aubrun, Marie-Pierre Béal:
Decidability of Conjugacy of Tree-Shifts of Finite Type. ICALP (1) 2009: 132-143 - 2008
- [j25]Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin:
Unambiguous Automata. Math. Comput. Sci. 1(4): 625-638 (2008) - [c16]Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin:
Embeddings of local automata. ISIT 2008: 2351-2355 - [i1]Marie-Pierre Béal, Dominique Perrin:
A quadratic algorithm for road coloring. CoRR abs/0803.0726 (2008) - 2007
- [c15]Marie-Pierre Béal, Fabio Burderi, Antonio Restivo:
Coding Partitions: Regularity, Maximality and Global Ambiguity. Developments in Language Theory 2007: 48-59 - [c14]Marie-Pierre Béal, Maxime Crochemore:
Minimizing local automata. ISIT 2007: 1376-1380 - 2006
- [j24]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): 443-460 (2006) - [j23]Marie-Pierre Béal, Dominique Perrin:
Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. 356(1-2): 6-13 (2006) - [c13]Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR 2006: 58-69 - [c12]Marie-Pierre Béal, Dominique Perrin:
Complete Codes in a Sofic Shift. STACS 2006: 127-136 - 2005
- [j22]Marie-Pierre Béal, Francesca Fiorenzi, Filippo Mignosi:
Minimal Forbidden Patterns of Multi-Dimensional Shifts. Int. J. Algebra Comput. 15(1): 73-93 (2005) - [j21]Marie-Pierre Béal, Dominique Perrin:
Codes and sofic constraints. Theor. Comput. Sci. 340(1): 381-393 (2005) - [j20]Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin:
A hierarchy of shift equivalent sofic shifts. Theor. Comput. Sci. 345(2-3): 190-205 (2005) - [j19]Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici:
Presentations of constrained systems with unconstrained positions. IEEE Trans. Inf. Theory 51(5): 1891-1900 (2005) - [c11]Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
On the Equivalence of -Automata. ICALP 2005: 397-409 - 2004
- [j18]Marie-Pierre Béal, Olivier Carton:
Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. 37(4): 483-502 (2004) - [j17]Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
An algorithmic view of gene teams. Theor. Comput. Sci. 320(2-3): 395-418 (2004) - [c10]Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin:
A Hierarchy of Irreducible Sofic Shifts. MFCS 2004: 611-622 - [c9]Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin:
The Syntactic Graph of a Sofic Shift. STACS 2004: 282-293 - 2003
- [j16]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Computing forbidden words of regular languages. Fundam. Informaticae 56(1-2): 121-135 (2003) - [j15]Marie-Pierre Béal, Dominique Perrin:
On the generating sequences of regular languages on k symbols. J. ACM 50(6): 955-980 (2003) - [j14]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): 45-63 (2003) - [j13]Marie-Pierre Béal:
Extensions of the method of poles for code construction. IEEE Trans. Inf. Theory 49(6): 1516-1523 (2003) - 2002
- [j12]Marie-Pierre Béal, Dominique Perrin:
A weak equivalence between shifts of finite type. Adv. Appl. Math. 29(2): 162-171 (2002) - [j11]Marie-Pierre Béal, Olivier Carton:
Determinization of transducers over finite and infinite words. Theor. Comput. Sci. 289(1): 225-251 (2002) - [c8]Marie-Pierre Béal, Dominique Perrin:
On the Enumerative Sequences of Regular Languages on k Symbols. STACS 2002: 547-558 - 2000
- [j10]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Words in Symbolic Dynamics. Adv. Appl. Math. 25(2): 163-193 (2000) - [j9]Marie-Pierre Béal, Olivier Carton:
Asynchronous sliding block maps. RAIRO Theor. Informatics Appl. 34(2): 139-156 (2000) - [j8]Marie-Pierre Béal, Olivier Carton:
Computing the prefix of an automaton. RAIRO Theor. Informatics Appl. 34(6): 503-514 (2000) - [j7]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. 30(4): 1211-1230 (2000) - [c7]Marie-Pierre Béal, Olivier Carton:
Determinization of Transducers over Infinite Words. ICALP 2000: 561-570 - [c6]Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406
1990 – 1999
- 1999
- [j6]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): 41-60 (1999) - [c5]Marie-Pierre Béal, Olivier Carton:
Asynchronous sliding block maps. Developments in Language Theory 1999: 47-59 - 1998
- [j5]Marie-Pierre Béal, Jean Senellart:
On the Bound of the Synchronization Delay of a Local Automaton. Theor. Comput. Sci. 205(1-2): 297-306 (1998) - [c4]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
Super-State Automata and Rational Trees. LATIN 1998: 42-52 - 1997
- [c3]Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
Enumerative Sequences of Leaves in Rational Trees. ICALP 1997: 76-86 - [p1]Marie-Pierre Béal, Dominique Perrin:
Symbolic Dynamics and Finite Automata. Handbook of Formal Languages (2) 1997: 463-506 - 1996
- [c2]Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer:
Cyclic Languages and Strongly Cyclic Languages. STACS 1996: 49-59 - [c1]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Symbolic Dynamics. STACS 1996: 555-566 - 1995
- [j4]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): 85-103 (1995) - 1994
- [j3]Jonathan J. Ashley, Marie-Pierre Béal:
A note on the method of poles for code construction. IEEE Trans. Inf. Theory 40(2): 512-517 (1994) - 1990
- [j2]Marie-Pierre Béal:
The method of poles: A coding method for constrained channels. IEEE Trans. Inf. Theory 36(4): 763-772 (1990)
1980 – 1989
- 1988
- [j1]Marie-Pierre Béal:
Codes Circulaires, Automates Locaux et Entropie. Theor. Comput. Sci. 57: 283-302 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
