photo

Marie-Pierre Béal

Copyright notice

MathSciNet

Preprints at the end of this page

Journals  (-)

  1. [bib]Marie-Pierre Béal, Mikhail V. Berlinkov, and 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. pp. 277–288.
  2. [bib]Marie-Pierre Béal, Maxime Crochemore, Bruce Moision, and Paul Siegel. Periodic-Finite-Type Shift Spaces. IEEE Transactions on Information Theory. 57 (6).  2011. pp. 3677–3691.
  3. [bib]Marie-Pierre Béal, Sylvain Lombardy, and Dominique Perrin. Embeddings of local automata. Illinois J. Math.. 54 (1).  2010. pp. 155–174.
  4. [bib]Marie-Pierre Béal and Dominique Perrin. Completing codes in a sofic shift. Theoretical Computer Science. 410 (43).  2009. pp. 4423–4431.
  5. [bib]Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, and Dominique Perrin. Unambiguous automata. Mathematics in Computer Science. 1 (4).  2008. pp. 625–638.
  6. [bib]Marie-Pierre Béal and Dominique Perrin. Codes, unambiguous automata and sofic systems. Theoretical Computer Science. 356 (1-2).  2006. pp. 6–13.
  7. [bib]Marie-Pierre Béal, Francesca Fiorenzi, and Dominique Perrin. The syntactic graph of a sofic shift is invariant under shift equivalence. International Journal of Algebra and Computation. 16 (3).  2006. pp. 443–460.
  8. [bib]Marie-Pierre Béal, Francesca Fiorenzi, and Dominique Perrin. A hierarchy of shift equivalent sofic shifts. Theoretical Computer Science. vol. 345. 2005. pp. 390–205.
  9. [bib]Marie-Pierre Béal and Dominique Perrin. Codes and sofic constraints. Theoretical Computer Science. 340 (2).  2005. pp. 381–393.
  10. [bib]Marie-Pierre Béal, Francesca Fiorenzi, and Filippo Mignosi. Minimal forbidden patterns of multi-dimensional shifts. International Journal of Algebra and Computation. 15 (1).  2005. pp. 73–93.
  11. [bib]Marie-Pierre Béal, Maxime Crochemore, and Gabriele Fici. Presentations of constrained systems with unconstrained positions. IEEE Transactions on Information Theory. 51 (5).  2005. pp. 1891–1900.
  12. [bib]Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, and Mathieu Raffinot. An algorithmic view of gene teams. Theoretical Computer Science. 320 (2-4).  2004. pp. 395–418.
  13. [bib]Marie-Pierre Béal and Olivier Carton. Determinization of transducers over infinite words: the general case. Theory of Computing Systems. 37 (4).  2004. pp. 483–502.
  14. [bib]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, and Marinella Sciortino. Computing forbidden words of regular languages. Fundamenta Informaticae. 56 (1-2).  2003. pp. 121–135. Note: Special issue on computing patterns in strings
  15. [bib]Marie-Pierre Béal. Extensions of the method of poles for code construction. IEEE Transactions on Information Theory. 49 (6).  2003. pp. 1516–1523.
  16. [bib]Marie-Pierre Béal and Dominique Perrin. On the generating sequences of regular languages on k-symbols. J. of the Association for Computing Machinery. 50 (6).  2003. pp. 955–980.
  17. [bib]Marie-Pierre Béal, Olivier Carton, Christophe Prieur, and Jacques Sakarovitch. Squaring transducers: An efficient procedure for deciding functionality and sequentiality. Theoretical Computer Science. 292 (1).  2003. pp. 45–63. Note: Selected papers in honor of Jean Berstel
  18. [bib]Marie-Pierre Béal and Dominique Perrin. A weak equivalence between shifts of finite type. Advances in Applied Mathematics. 29 (2).  2002. pp. 162–171.
  19. [bib]Marie-Pierre Béal and Olivier Carton. Determinization of transducers over finite and infinite words. Theoretical Computer Science. 289 (1).  2002. pp. 225–251.
  20. [bib]Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. A finite state version of the Kraft-McMillan theorem. SIAM Journal on Computing. 30 (4).  2000. pp. 1211–1230.
  21. [bib]Marie-Pierre Béal and Olivier Carton. Asynchronous sliding block maps. Informatique Theorique et Applications. 34 (2).  2000. pp. 139–156.
  22. [bib]Marie-Pierre Béal and Olivier Carton. Computing the prefix of an automaton. Informatique Theorique et Applications. 34 (6).  2000. pp. 503–514.
  23. [bib]M.-P. Béal, F. Mignosi, A. Restivo, and M. Sciortino. Forbidden words in symbolic dynamics. Advances in Applied Mathematics. 25 (2).  2000. pp. 163–193.
  24. [bib]Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Enumerative sequences of leaves and nodes in rational trees. Theoretical Computer Science. 221 (1-2).  1999. pp. 41–60. Note: Full version of ICALP'97
  25. [bib]Marie-Pierre Béal and Jean Senellart. On the bound of the synchronization delay of a local automaton. Theoretical Computer Science. 205 (1-2).  1998. pp. 297–306.
  26. [bib]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. Informatique Theorique et Applications. 29 (2).  1995. pp. 85–103.
  27. [bib]Jonathan Ashley and Marie-Pierre Béal. A note on the method of poles for code construction. IEEE Transactions on Information Theory. 40 (2).  1994. pp. 512–517.
  28. [bib]Marie-Pierre Béal. The method of poles: a coding method for constrained channels. IEEE Transactions on Information Theory. 36 (4).  1990. pp. 763–772.
  29. [bib]Marie-Pierre Béal. Codes circulaires, automates locaux et entropie. Theoretical Computer Science. 57 (2-3).  1988. pp. 283–302.
  30. [bib]Marie-Pierre Béal and Dominique Perrin. Une caractérisation des ensembles sofiques. C. R. Acad. Sci. Paris Sér. I Math.. 303 (6).  1986. pp. 255–257.

In proceedings  (-)

  1. [bib]Nathalie Aubrun and Marie-Pierre Béal. Sofic and Almost of Finite Type Tree-Shifts. In, E.W. Mayr, Farid Ablayev, editors, 5th International Computer Science Symposium in Russia (CSR'10). no. 6072. Lecture Notes in Computer Science.  2010. pp. 12–24.  Springer-Verlag.
  2. [bib]Marie-Pierre Béal and Dominique Perrin. A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Developments in Language Theory (DLT'09).  2009. pp. 81–90.
  3. [bib]Nathalie Aubrun and Marie-Pierre Béal. Decidability of conjugacy of tree shifts of finite type. 36th International Colloquium on Automata, Languages and Programming (ICALP'09). vol. 5555. Lecture Notes in Computer Science.  5-12 July 2009. pp. 132–143.  Springer-Verlag.
  4. [bib]Marie-Pierre Béal and Maxime Crochemore. Minimizing incomplete automata. Finite-State Methods and Natural Language Processing (FSMNLP'08). Joint Research Centre.  2008. pp. 9–16.
  5. [bib]Marie-Pierre Béal, Sylvain Lombardy, and Dominique Perrin. Embeddings of local automata. IEEE International Symposium on Information Theory (ISIT'08).  6-11 July 2008. pp. 2351–2355.
  6. [bib]Marie-Pierre Béal, Fabio Burderi, and Antonio Restivo. Coding partition: regularity, maximality and global ambiguity. In, Tero Harju, Juhani Karhumäki, Arto Lepistö, editors, International Conference on Developments in Language Theory (DLT'07). vol. 4588. Lecture Notes in Computer Science.  2007. pp. 48–59.  Springer.
  7. [bib]Marie-Pierre Béal and Maxime Crochemore. Minimizing local automata. In, G. Caire, M. Fossorier, editors, IEEE International Symposium on Information Theory (ISIT'07). no. 07CH37924C.  2007. pp. 1376–1380.  IEEE Catalog.
  8. [bib]Marie-Pierre Béal and Dominique Perrin. Complete codes in a sofic shift. 23rd International Symposium on Theoretical Aspects of Computer Science (STACS'06). vol. 3884. LNCS.  Marseille, France. 2006. pp. 127–136.  Springer-Verlag.
  9. [bib]Marie-Pierre Béal, Sylvain Lombardy, and Jacques Sakarovitch. Conjugacy and Equivalence of Weighted Automata and Functional Transducers. In, Dima Grigoriev, John Harrison, Edward A. Hirsch, editors, 1st International Computer Science Symposium in Russia (CSR 2006). vol. 3967. LNCS.  St. Petersburg, Russia. June 2006. pp. 58–69.  Springer-Verlag.
  10. [bib]Marie-Pierre Béal, Sylvain Lombardy, and Jacques Sakarovitch. On the equivalence of {Z}-automata. In, Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005). vol. 3580. LNCS.  Lisbon, Portugal. July 2005. pp. 397–409.  Springer-Verlag.
  11. [bib]Marie-Pierre Béal, Francesca Fiorenzi, and Dominique Perrin. A hierarchy of irreducible sofic shifts. 29th International Symposium on Mathematical Foundations of Computer Science 2004. vol. 3153. LNCS.  2004. pp. 611–622.  Springer-Verlag.
  12. [bib]Marie-Pierre Béal, Francesca Fiorenzi, and Dominique Perrin. The syntactic graph of a sofic shift. In, Volker Diekert, Michel Habib, editors, 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004). vol. 2296. LNCS.  Montpellier, France. March 2004. pp. 282–293.  Springer-Verlag.
  13. [bib]Marie-Pierre Béal and Dominique Perrin. On the enumerative sequences of regular languages on k symbols. In, H. Alt, A. Ferreira, editors, 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002). vol. 2285. LNCS.  2002. pp. 547–558.  Springer-Verlag.
  14. [bib]Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Length distributions and regular sequences. In, Joachim Rosenthal, Brian Marcus, editors, Codes, systems, and graphical models (Minneapolis, MN, 1999). vol. 123. IMA Volumes in Mathematics and its Applications.  2001. pp. 415–437.  Springer-Verlag.
  15. [bib]Marie-Pierre Béal and Olivier Carton. Determinization of transducers over infinite words. In, U. Montanari, editors, 27thInternational Colloquium on Automata, Languages and Programming (ICALP 2000). vol. 1853. LNCS.  2000. pp. 561–570.  Springer-Verlag.
  16. [bib]Marie-Pierre Béal, Olivier Carton, Christophe Prieur, and Jacques Sakarovitch. Squaring transducers: An efficient procedure for deciding functionality and sequentiality. In, G. Gonnet, D. Panario, A. Viola, editors, 4th Latin American Theoretical INformatics (LATIN'2000). vol. 1776. LNCS.  Punta del Este, Uruguay. April 2000. pp. 407–416.  Springer-Verlag.
  17. [bib]Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Super-state automata and rational trees. In, C.L. Lucchesi, A.V. Moura, editors, 3rd Latin American Theoretical INformatics (LATIN'98). vol. 1380. LNCS.  Campinas, Brazil. April 1998. pp. 42–52.  Springer-Verlag.
  18. [bib]Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Enumerative sequences of leaves in rational trees. International Colloquium on Automata, Languages and Programming (ICALP 1997). vol. 1256. LNCS.  1997. pp. 76–86.  Springer-Verlag.
  19. [bib]Marie-Pierre Béal, Olivier Carton, and Christophe Reutenauer. Cyclic languages and strongly cyclic languages. International Symposium on Theoretical Aspects of Computer Science (STACS 96). vol. 1046. LNCS.  Grenoble, France. 1996. pp. 49–59.  Springer-Verlag.
  20. [bib]Marie-Pierre Béal, Filippo Mignosi, and Antonio Restivo. Minimal forbidden words and symbolic dynamics. 13th International Symposium on Theoretical Aspects of Computer Science (STACS 96). vol. 1046. LNCS.  1996. pp. 555–566.  Springer-Verlag.

Collections, books and book chapters  (-)

  1. [bib]Marie-Pierre Béal, Jean Berstel, Brian H. Marcus, Dominique Perrin, Christophe Reutenauer, and Paul H. Siegel. Variable-length codes and finite automata. Selected Topics in Information and Coding Theory. Edited by I. Woungang, S. Misra, S.C. Misra. World Scientific.  2010. pp. 505–584.
  2. [bib]Marie-Pierre Béal and Dominique Perrin. Handbook of formal languages. 10. Edited by G. Rosenberg, A. Salomaa. Springer-Verlag. vol. 2. 1997. pp. 463–505. Note: Chapter title: Symbolic dynamics and finite automata.
  3. [bib]Marie-Pierre Béal. Codage Symbolique. Masson.  1993.

Phd thesis   (-)

  1. [bib]Marie-Pierre Béal. Codage symbolique. Habilitation à diriger des recherches. I.G.M., Université de Marne-la-Vallée.  2001. Jury : J.-P. Allouche, G. Cohen, R. Cori, M. Crochemore, C. Frougny, B. Marcus, F. Morain et D. Perrin.

Other   (-)

  1. [bib]Nathalie Aubrun and Marie-Pierre Béal. Sofic Tree-Shifts.  2012. Note: To appear
  2. [bib]Nathalie Aubrun and Marie-Pierre Béal. Tree-shifts of finite type.  2011. Note: Preprint
  3. [bib]Marie-Pierre Béal and Dominique Perrin. A quadratic algorithm for road coloring. Université Paris-Est.  2008.http://arxiv.org/abs/0803.0726
  4. [bib]Marie-Pierre Béal, Sylvain Lombardy, and Dominique Perrin. Embeddings of automata. Université Paris Est.  2007. Note: Preprint
  5. [bib]Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, and Dominique Perrin. On the synchronization delay of local automata. London Algorithmic Workshop LAW 2007.  2007.
  6. [bib]Marie-Pierre Béal, Fabio Burderi, and Antonio Restivo. Regular coding partition. Mons Day 2006.  2006.
  7. [bib]Marie-Pierre Béal. Codes in symbolic systems. Developments in Language Theory, 11th International Conference, DLT 2005.  2005. Note: Conférence invitée
  8. [bib]Marie-Pierre Béal. On rotationally invariant codes. I.G.M., Université de Marne-la-Vallée. 98-13.  1998.

Conjugacies of automata with multiplicities (papers and slides)

See the slides of Sylvain Lombardy, Jacques Sakarovitch, and the CSR'06 paper for the transducers.