All

Preprints

  • {$\mathbb{N}$}-algebraicity of zeta functions of sofic-Dyck shifts (Marie-Pierre Béal, Catalin Dima) arxiv
Books
[1] Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings, (Marie-Pierre Béal, Olivier Carton, eds.), Springer, volume 7907, 2013. [bibtex] [pdf] [doi]
[2] Codage symbolique (Marie-Pierre Béal), Masson, 1993. [bibtex]
Book Chapters
[3] Variable-length codes and finite automata (Marie-Pierre Béal, Jean Berstel, Brian Marcus, Dominique Perrin, Christophe Reutenauer, Paul H. Siegel), Chapter in Selected topics in information and coding theory (Sudip Misra Subhas Chandra Misra Issac Woungang, ed.), World Scientific Publishing Company, 2010. [bibtex] [pdf]
[4] Symbolic Dynamics (Marie-Pierre Béal, Jean Berstel, Soren Eilers, Dominique Perrin), Chapter in , 2010. (to appear in Handbook of Automata) [bibtex] [pdf]
[5] Symbolic dynamics and finite automata (Marie-Pierre Béal, Dominique Perrin), Chapter in Handbook of formal languages, Vol. 2, Springer, 1997. [bibtex] [pdf]
Refereed Articles
[6] Sofic-Dyck shifts (Marie-Pierre Béal, Michel Blockelet, Catalin Dima), In Theor. Comput. Sci., volume 609, 2016. [bibtex] [pdf]
[7] Tree algebra of sofic tree languages (Nathalie Aubrun, Marie-Pierre Béal), In RAIRO - Theor. Inf. and Applic., volume 48, 2014. [bibtex] [pdf]
[8] A quadratic algorithm for road coloring (Marie-Pierre Béal, Dominique Perrin), In Discrete Applied Mathematics, volume 169, 2014. [bibtex] [pdf] [doi]
[9] Sofic Tree-Shifts (Nathalie Aubrun, Marie-Pierre Béal), In Theory Comput. Syst., 2013. [bibtex] [pdf]
[10] Tree-shifts of finite type (Nathalie Aubrun, Marie-Pierre Béal), In Theoret. Comput. Sci., volume 459, 2012. [bibtex] [pdf]
[11] Periodic-Finite-Type Shift Spaces (Marie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel), In IEEE Trans. Inform. Theory, volume 57, 2011. [bibtex] [pdf]
[12] A quadratic upper bound on the size of a synchronizing word in one-cluster automata (Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin), In Int. J. Found. Comput. Sci., volume 22, 2011. [bibtex] [pdf]
[13] Embeddings of local automata (Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin), In Illinois J. Math., volume 54, 2010. [bibtex] [pdf]
[14] Completing codes in a sofic shift (Marie-Pierre Béal, Dominique Perrin), In Theoret. Comput. Science, volume 410, 2009. [bibtex] [pdf]
[15] Coding partitions of regular sets (Marie-Pierre Béal, Fabio Burderi, Antonio Restivo), In Internat. J. Algebra Comput., volume 19, 2009. [bibtex] [pdf]
[16] Unambiguous automata (Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin), In Mathematics in Computer Science, volume 1, 2008. [bibtex] [pdf]
[17] Codes, unambiguous automata and sofic systems (Marie-Pierre Béal, Dominique Perrin), In Theoret. Comput. Sci., volume 356, 2006. [bibtex] [pdf]
[18] The syntactic graph of a sofic shift is invariant under shift equivalence (Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin), In Internat. J. Algebra Comput., volume 16, 2006. [bibtex] [pdf]
[19] Codes and sofic constraints (Marie-Pierre Béal, Dominique Perrin), In Theoret. Comput. Sci., volume 340, 2005. [bibtex] [pdf]
[20] A hierarchy of shift equivalent sofic shifts (Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin), In Theoret. Comput. Sci., volume 345, 2005. [bibtex] [pdf]
[21] Minimal forbidden patterns of multi-dimensional shifts (Marie-Pierre Béal, Francesca Fiorenzi, Filippo Mignosi), In Internat. J. Algebra Comput., volume 15, 2005. [bibtex] [pdf]
[22] Presentations of constrained systems with unconstrained positions (Marie-Pierre Béal, Gabriele Fici, Maxime Crochemore), In IEEE Trans. Inform. Theory, volume 41, 2005. [bibtex] [pdf]
[23] Determinization of transducers over infinite words: the general case (Marie-Pierre Béal, Olivier Carton), In Theory Comput. Syst., volume 37, 2004. [bibtex] [pdf]
[24] An algorithmic view of gene teams (Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot), In Theoret. Comput. Sci., volume 320, 2004. [bibtex] [pdf]
[25] On the generating sequences of regular languages on $k$-symbols (Marie-Pierre Béal, Dominique Perrin), In J. ACM, volume 50, 2003. [bibtex] [pdf]
[26] Computing forbidden words of regular languages (Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino), In Fund. Inform., volume 56, 2003. (Special issue on computing patterns in strings) [bibtex] [pdf]
[27] Squaring transducers: an efficient procedure for deciding functionality and sequentiality (Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch), In Theoret. Comput. Sci., volume 292, 2003. (Selected papers in honor of Jean Berstel) [bibtex]
[28] Extensions of the method of poles for code construction (Marie-Pierre Béal), In IEEE Trans. Inform. Theory, volume 49, 2003. [bibtex] [pdf]
[29] A weak equivalence between shifts of finite type (Marie-Pierre Béal, Dominique Perrin), In Adv. in Appl. Math., volume 29, 2002. [bibtex] [pdf]
[30] Determinization of transducers over finite and infinite words (Marie-Pierre Béal, Olivier Carton), In Theoret. Comput. Sci., volume 289, 2002. [bibtex] [pdf]
[31] Forbidden words in symbolic dynamics (M.-P. Béal, F. Mignosi, A. Restivo, M. Sciortino), In Adv. in Appl. Math., volume 25, 2000. [bibtex] [pdf]
[32] Asynchronous sliding block maps (Marie-Pierre Béal, Olivier Carton), In Theor. Inform. Appl., volume 34, 2000. [bibtex]
[33] Computing the prefix of an automaton (Marie-Pierre Béal, Olivier Carton), In Theor. Inform. Appl., volume 34, 2000. [bibtex] [pdf]
[34] A finite state version of the Kraft-McMillan theorem (Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin), In SIAM J. Comput., volume 30, 2000. [bibtex] [pdf]
[35] Enumerative sequences of leaves and nodes in rational trees (Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin), In Theoret. Comput. Sci., volume 221, 1999. (ICALP '97 (Bologna)) [bibtex] [pdf]
[36] On the bound of the synchronization delay of a local automaton (Marie-Pierre Béal, Jean Senellart), In Theoret. Comput. Sci., volume 205, 1998. [bibtex] [pdf]
[37] 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), In RAIRO Inform. Théor. Appl., volume 29, 1995. [bibtex]
[38] A note on the method of poles for code construction (Jonathan Ashley, Marie-Pierre Béal), In IEEE Trans. Inform. Theory, volume 40, 1994. [bibtex]
[39] The method of poles: a coding method for constrained channels (Marie-Pierre Béal), In IEEE Trans. Inform. Theory, volume 36, 1990. [bibtex]
[40] Codes circulaires, automates locaux et entropie (Marie-Pierre Béal), In Theoret. Comput. Sci., volume 57, 1988. [bibtex]
[41] Une caractérisation des ensembles sofiques (Marie-Pierre Béal, Dominique Perrin), In C. R. Acad. Sci. Paris Sér. I Math., volume 303, 1986. [bibtex]
Refereed Conference Papers
[42] Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (Marie-Pierre Béal, Pavel Heller), In Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings., Springer, volume 9168, 2015. [bibtex] [pdf]
[43] Sofic-Dyck Shifts (Marie-Pierre Béal, Michel Blockelet, Catalin Dima), In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, 2014. [bibtex] [pdf] [doi]
[44] Toward a Timed Theory of Channel Coding (Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin), In FORMATS, 2012. [bibtex] [pdf]
[45] Decidability of geometricity of regular languages (Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy), In Developments in Language Theory, 2012. [bibtex] [pdf]
[46] Sofic and almost of finite type tree-shifts (Nathalie Aubrun, Marie-Pierre Béal), In 5th International Computer Science Symposium in Russia, (CSR 2010), Springer-Verlag, 2010. [bibtex] [pdf]
[47] Decidability of conjugacy of tree shifts of finite type (Nathalie Aubrun, Marie-Pierre Béal), In 36th International Colloquium on Automata, Languages and Programming (ICALP'09), Springer-Verlag, volume 5555, 2009. [bibtex] [pdf]
[48] A quadratic upper bound on the size of a synchronizing word in one-Cluster automata (Marie-Pierre Béal, Dominique Perrin), In Developments in Language Theory, 2009. [bibtex] [pdf]
[49] Minimizing incomplete automata (Marie-Pierre Béal, Maxime Crochemore), In Finite-State Methods and Natural Language Processing (FSMNLP'08), 2008. [bibtex] [pdf]
[50] Embeddings of local automata (Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin), In 2008 IEEE International Symposium on Information Theory, ISIT 2008, 2008. [bibtex] [pdf]
[51] Minimizing local automata (Marie-Pierre Béal, Maxime Crochemore), In 2007 IEEE International Symposium on Information Theory, ISIT 2007, 2007. [bibtex] [pdf]
[52] Coding partitions: regularity, maximality, and global ambiguity (Marie-Pierre Béal, Fabio Burderi, Antonio Restivo), In Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings (Tero Harju, Juhani Karhumäki, Arto Lepistö, eds.), Springer, volume 4588, 2007. [bibtex] [pdf]
[53] Complete codes in a sofic shift (Marie-Pierre Béal, Dominique Perrin), In STACS 2006, Springer, volume 3884, 2006. [bibtex] [pdf]
[54] Conjugacy and equivalence of weighted automata and functional transducers (Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch), In Computer Science - Theory and Applications (CSR'06), Springer, volume 3967, 2006. [bibtex] [pdf]
[55] On the equivalence of $\mathbbZ$-automata (Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch), In Automata, languages and programming (ICALP, 2005), Springer, volume 3580, 2005. [bibtex] [pdf]
[56] The syntactic graph of a sofic shift (Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin), In STACS 2004, Springer, volume 2996, 2004. [bibtex] [pdf]
[57] A hierarchy of irreducible sofic shifts (Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin), In Mathematical foundations of computer science MFCS'04, Springer, volume 3153, 2004. [bibtex] [pdf]
[58] On the enumerative sequences of regular languages on $k$ symbols (Marie-Pierre Béal, Dominique Perrin), In STACS 2002 (H. Alt, A. Ferreira, eds.), Springer, volume 2285, 2002. [bibtex] [pdf]
[59] Length distributions and regular sequences (Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin), In Codes, systems, and graphical models (Minneapolis, MN, 1999) (Joachim Rosenthal, Brian Marcus, eds.), Springer, volume 123, 2001. [bibtex] [pdf]
[60] Squaring transducers: An efficient procedure for deciding functionality and sequentiality (Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch), In LATIN'2000 (G. Gonnet, D. Panario, A. Viola, eds.), Springer, volume 1776, 2000. [bibtex]
[61] Determinization of transducers over infinite words (Marie-Pierre Béal, Olivier Carton), In ICALP 2000) (U. Montanari, others, eds.), Springer, volume 1853, 2000. [bibtex] [pdf]
[62] Asynchronous sliding block maps (Marie-Pierre Béal, Olivier Carton), In Developments in language theory (Aachen, 1999), World Sci. Publishing, 2000. [bibtex]
[63] Super-state automata and rational trees (Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin), In LATIN'98: theoretical informatics (Campinas, 1998), Springer, volume 1380, 1998. [bibtex] [pdf]
[64] Enumerative sequences of leaves in rational trees (Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin), In ICALP'97: Automata, languages and programming (Bologna, 1997), Springer, volume 1256, 1997. [bibtex] [pdf]
[65] Minimal forbidden words and symbolic dynamics (Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo), In STACS 96 (Grenoble, 1996), Springer, volume 1046, 1996. [bibtex] [pdf]
[66] Cyclic languages and strongly cyclic languages (Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer), In STACS 96 (Grenoble, 1996), Springer, volume 1046, 1996. [bibtex] [pdf]
[67] Codage dans certains systèmes dynamiques symboliques (Jonathan Ashley, Marie-Pierre Béal), In Actes des Journées Montoises 1990, Université de Mons-Hainaut, 1990. [bibtex]
Refereed Workshop Papers
[68] Zeta functions of finite-type-Dyck shifts are N-algebraic (Marie-Pierre Béal, Michel Blockelet, Catalin Dima), In 2014 Information Theory and Applications Workshop, ITA 2014, San Diego, CA, USA, February 9-14, 2014, 2014. [bibtex] [pdf] [doi]
Other Publications
[69] Codage symbolique (Marie-Pierre Béal), PhD thesis, Université de Marne-la-Vallée, 2001. (Habilitation à diriger des recherches) [bibtex]
[70] On rotationally invariant codes (Marie-Pierre Béal), Technical report, Institut Gaspard-Monge, 1998. [bibtex] [pdf]
[71] Au sujet du premier théorème d'Adler sur l'équivalence de deux systèmes de type fini de même entropie (Marie-Pierre Béal), Technical report, LITP, 1988. [bibtex]
[72] Codage, automates locaux et entropie (Marie-Pierre Béal), PhD thesis, Université Paris 7, 1987. [bibtex]
Powered by bibtexbrowser