[1]
M.-P. Béal, V. Jugé, J. Mairesse, and D. Perrin, “Sofic measures,” arXiv, 2026,Available: https://arxiv.org/abs/2604.11212
[2]
M.-P. Béal and A. B. Gorman, “One-sided hom shifts,” arXiv, 2025,Available: https://arxiv.org/abs/2509.24754
[3]
M.-P. Béal, M. Crochemore, and G. Romana, “Checking and producing word attractors,” arXiv, 2025,Available: https://arxiv.org/abs/2509.08503
[4]
M.-P. Béal and M. Crochemore, “Specific Patterns Against Reference Sequences,” in From strings to graphs, and back again: A festschrift for roberto grossi’s 60th birthday, 2025, vol. 132, pp. 14:1–14:12. doi: 10.4230/OASIcs.Grossi.14.
[5]
M.-P. Béal, D. Perrin, A. Restivo, and W. Steiner, “Recognizability in S-adic shifts,” Israel. J. Math., 2025, doi: https://doi.org/10.1007/s11856-025-2784-4.
[6]
M.-P. Béal, D. Perrin, and A. Restivo, “Decidable problems in substitution shifts,” J. Comput. Syst. Sci., vol. 143, p. 103529, 2024,Available: https://arxiv.org/abs/2112.14499
[7]
M.-P. Béal, D. Perrin, and A. Restivo, “Recognizability of morphisms,” Erg. Theor. & Dyn. Sys., vol. 43, no. 11, pp. 3578–3602, 2023, doi: 10.1017/etds.2022.109.
[8]
M.-P. Béal, D. Perrin, and A. Restivo, “Unambiguously coded shifts,” European Journal of Combinatorics, vol. 119, no. C, 2024,Available: https://arxiv.org/abs/2103.01012
[9]
M.-P. Béal and M. Crochemore, “Fast detection of specific fragments against a set of sequences,” in 27th international conference on developments in language theory, DLT 2023, 2023, vol. 13911, pp. 51–60.Available: https://arxiv.org/abs/2208.03451
[10]
M.-P. Béal and M. Crochemore, “Checking whether a word is Hamming-isometric in linear time,” Theor. Comput. Sci., pp. 55–59, 2022,Available: https://arxiv.org/abs/2106.10541
[11]
M.-P. Béal, J. Berstel, S. Eilers, and D. Perrin, “Symbolic dynamics,” in Handbook of Automata Theory, vol. II, J.-É. Pin, Ed. EMS Press, 2021, pp. 987–1031.Available: https://arxiv.org/abs/1006.1265
[12]
M.-P. Béal, V. Berthé, D. Perrin, and A. Restivo, “A note on one-sided recognizable morphisms,” CoRR, vol. abs/2110.10267. 2022.Available: https://arxiv.org/abs/2204.03892
[13]
M.-P. Béal and P. Heller, “Shifts of k-nested sequences,” Theor. Comput. Sci., vol. 658, pp. 18–26, 2017.
[14]
M.-P. Béal and P. Heller, “Generalized Dyck shifts,” in Computer science - theory and applications - 12th international computer science symposium in russia, CSR 2017, kazan, russia, june 8-12, 2017, proceedings, 2017, vol. 10304, pp. 99–111.
[15]
M.-P. Béal, M. Blockelet, and C. Dima, “Sofic-Dyck shifts,” Theor. Comput. Sci., vol. 609, pp. 226–244, 2016,Available: http://dx.doi.org/10.1016/j.tcs.2015.09.027
[16]
M.-P. Béal and D. Perrin, “A quadratic algorithm for road coloring,” Discrete Applied Mathematics, vol. 169, pp. 15–29, 2014, doi: 10.1016/j.dam.2013.12.002.
[17]
N. Aubrun and M.-P. Béal, “Tree algebra of sofic tree languages,” RAIRO - Theor. Inf. and Applic., vol. 48, no. 4, pp. 431–451, 2014,Available: http://dx.doi.org/10.1051/ita/2014018
[18]
M.-P. Béal, M. Blockelet, and C. Dima, “Zeta functions of finite-type-Dyck shifts are N-algebraic,” in 2014 information theory and applications workshop, ITA 2014, san diego, CA, USA, february 9-14, 2014, 2014, pp. 1–8. doi: 10.1109/ITA.2014.6804286.
[19]
M.-P. Béal, M. Blockelet, and C. Dima, “Sofic-Dyck shifts,” in Mathematical foundations of computer science 2014 - 39th international symposium, MFCS 2014, budapest, hungary, august 25-29, 2014. Proceedings, part I, 2014, pp. 63–74. doi: 10.1007/978-3-662-44522-8_6.
[20]
M.-P. Béal and O. Carton, Eds., Developments in language theory - 17th international conference, DLT 2013, marne-la-vallée, france, june 18-21, 2013. proceedings, vol. 7907. Springer, 2013. doi: 10.1007/978-3-642-38771-5.
[21]
N. Aubrun and M.-P. Béal, “Sofic tree-shifts,” Theory Comput. Syst., no. 4, pp. 621–644, 2013,Available: http://dx.doi.org/10.1007/s00224-013-9456-1
[22]
E. Asarin, N. Basset, M.-P. Béal, A. Degorre, and D. Perrin, “Toward a timed theory of channel coding,” in FORMATS, 2012, pp. 27–42.Available: http://dx.doi.org/10.1007/978-3-642-33365-1_4
[23]
N. Aubrun and M.-P. Béal, “Tree-shifts of finite type,” Theoret. Comput. Sci., vol. 459, pp. 16–25, 2012,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/TCS2012final.pdf
[24]
M.-P. Béal, J.-M. Champarnaud, J.-P. Dubernard, H. Jeanne, and S. Lombardy, “Decidability of geometricity of regular languages,” in Developments in language theory, 2012, pp. 62–72.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/geometriqueDLT2012.pdf
[25]
M.-P. Béal, M. Crochemore, B. E. Moision, and P. H. Siegel, “Periodic-finite-type shift spaces,” IEEE Trans. Inform. Theory, vol. 57, no. 6, pp. 3677–3691, 2011,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/Pftss_Second_Revision.pdf
[26]
M.-P. Béal, M. V. Berlinkov, and D. Perrin, “A quadratic upper bound on the size of a synchronizing word in one-cluster automata,” Int. J. Found. Comput. Sci., vol. 22, no. 2, pp. 277–288, 2011,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/cernyJournalFinal.pdf
[27]
M.-P. Béal, S. Lombardy, and D. Perrin, “Embeddings of local automata,” Illinois J. Math., vol. 54, no. 1, pp. 155–174, 2010,Available: http://hal-univ-mlv.archives-ouvertes.fr/hal-00619770/en/
[28]
N. Aubrun and M.-P. Béal, “Sofic and almost of finite type tree-shifts,” in Computer science - theory and applications, 5th international computer science symposium in russia, CSR 2010, kazan, russia, june 16-20, 2010. proceedings, 2010, vol. 6072, pp. 12–24.Available: http://monge.univ-mlv.fr/~aubrun/articles/csr2010.pdf
[29]
M.-P. Béal, J. Berstel, B. Marcus, D. Perrin, C. Reutenauer, and P. H. Siegel, “Variable-length codes and finite automata,” in Selected topics in information and coding theory, S. C. M. Issac Woungang Sudip Misra, Ed. World Scientific Publishing Company, 2010, pp. 505–584.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/2008handbookcodes.pdf
[30]
N. Aubrun and M.-P. Béal, “Decidability of conjugacy of tree shifts of finite type,” in 36th international colloquium on automata, languages and programming (ICALP’09), Jul. 2009, vol. 5555, pp. 132–143.Available: http://www.springerlink.com/content/k2568m1662kp06j5/fulltext.pdf
[31]
M.-P. Béal and D. Perrin, “A quadratic upper bound on the size of a synchronizing word in one-cluster automata,” in Developments in language theory, 2009, pp. 81–90.Available: http://dx.doi.org/10.1007/978-3-642-02737-6_6
[32]
M.-P. Béal, F. Burderi, and A. Restivo, “Coding partitions of regular sets,” Internat. J. Algebra Comput., vol. 19, no. 8, pp. 1011–1023, 2009,Available: http://dx.doi.org/10.1142/S0218196709005457
[33]
M.-P. Béal and D. Perrin, “Completing codes in a sofic shift,” Theoret. Comput. Science, vol. 410, no. 43, pp. 4423–4431, 2009,Available: http://dx.doi.org/10.1016/j.tcs.2009.07.023
[34]
M.-P. Béal, S. Lombardy, and D. Perrin, “Embeddings of local automata,” in 2008 IEEE international symposium on information theory, ISIT 2008, 2008, pp. 2351–2355.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/completionLocal.pdf
[35]
M.-P. Béal, E. Czeizler, J. Kari, and D. Perrin, “Unambiguous automata,” Mathematics in Computer Science, vol. 1, no. 4, pp. 625–638, 2008,Available: http://dx.doi.org/10.1007/s11786-007-0027-1
[36]
M.-P. Béal and M. Crochemore, “Minimizing incomplete automata,” in Finite-state methods and natural language processing (FSMNLP’08), 2008, pp. 9–16.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/minimizingIncomplete.pdf
[37]
M.-P. Béal, F. Burderi, and A. Restivo, “Coding partitions: Regularity, maximality, and global ambiguity,” in Developments in language theory, 11th international conference, DLT 2007, turku, finland, july 3-6, 2007, proceedings, 2007, vol. 4588, pp. 48–59.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/DLT07.pdf
[38]
M.-P. Béal and M. Crochemore, “Minimizing local automata,” in 2007 IEEE international symposium on information theory, ISIT 2007, 2007, pp. 1376–1380.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/aftIEEE.pdf
[39]
M.-P. Béal, S. Lombardy, and J. Sakarovitch, “Conjugacy and equivalence of weighted automata and functional transducers,” in Computer science - theory and applications (CSR’06), 2006, vol. 3967, pp. 58–69.Available: http://igm.univ-mlv.fr/~lombardy/publi/CSR06.pdf
[40]
M.-P. Béal and D. Perrin, “Complete codes in a sofic shift,” in STACS 2006, 2006, vol. 3884, pp. 127–136.Available: http://hal-univ-mlv.archives-ouvertes.fr/docs/00/61/98/56/PDF/hal.pdf
[41]
M.-P. Béal and D. Perrin, “Codes, unambiguous automata and sofic systems,” Theoret. Comput. Sci., vol. 356, no. 1–2, pp. 6–13, 2006,Available: http://hal.archives-ouvertes.fr/hal-00619226/
[42]
M.-P. Béal, F. Fiorenzi, and D. Perrin, “The syntactic graph of a sofic shift is invariant under shift equivalence,” Internat. J. Algebra Comput., vol. 16, no. 3, pp. 443–460, 2006,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/aftTCS.pdf
[43]
M.-P. Béal, F. Fiorenzi, and D. Perrin, “A hierarchy of shift equivalent sofic shifts,” Theoret. Comput. Sci., vol. 345, pp. 390–205, 2005,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/greenSTACS.pdf
[44]
M.-P. Béal, S. Lombardy, and J. Sakarovitch, “On the equivalence of ℤ-automata,” in Automata, languages and programming (ICALP, 2005), 2005, vol. 3580, pp. 397–409.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/icalp05-050429.pdf
[45]
M.-P. Béal, G. Fici, and M. Crochemore, “Presentations of constrained systems with unconstrained positions,” IEEE Trans. Inform. Theory, vol. 41, no. 5, pp. 381–393, 2005,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/unconstrained2bis.pdf
[46]
M.-P. Béal and D. Perrin, “Codes and sofic constraints,” Theoret. Comput. Sci., vol. 340, no. 2, pp. 381–393, 2005,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/restivo.pdf
[47]
M.-P. Béal, F. Fiorenzi, and F. Mignosi, “Minimal forbidden patterns of multi-dimensional shifts,” Internat. J. Algebra Comput., vol. 15, no. 1, pp. 73–93, 2005,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/bidimensional.pdf
[48]
M.-P. Béal and O. Carton, “Determinization of transducers over infinite words: The general case,” Theory Comput. Syst., vol. 37, no. 4, pp. 483–502, 2004,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/det2.pdf
[49]
M.-P. Béal, F. Fiorenzi, and D. Perrin, “A hierarchy of irreducible sofic shifts,” in Mathematical foundations of computer science MFCS’04, 2004, vol. 3153, pp. 611–622.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/aftMFCS.pdf
[50]
M.-P. Béal, A. Bergeron, S. Corteel, and M. Raffinot, “An algorithmic view of gene teams,” Theoret. Comput. Sci., vol. 320, no. 2–4, pp. 395–418, 2004,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/Fusion-geneteam.pdf
[51]
M.-P. Béal, F. Fiorenzi, and D. Perrin, “The syntactic graph of a sofic shift,” in STACS 2004, 2004, vol. 2996, pp. 282–293.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/greenSTACS.pdf
[52]
M.-P. Béal and D. Perrin, “On the generating sequences of regular languages on k-symbols,” J. ACM, vol. 50, no. 6, pp. 955–980 (electronic), 2003,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/kaire.pdf
[53]
M.-P. Béal, M. Crochemore, F. Mignosi, A. Restivo, and M. Sciortino, “Computing forbidden words of regular languages,” Fund. Inform., vol. 56, no. 1–2, pp. 121–135, 2003,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/fialgo.pdf
[54]
M.-P. Béal, “Extensions of the method of poles for code construction,” IEEE Trans. Inform. Theory, vol. 49, no. 6, pp. 1516–1523, 2003,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/ieee.pdf
[55]
M.-P. Béal, O. Carton, C. Prieur, and J. Sakarovitch, “Squaring transducers: An efficient procedure for deciding functionality and sequentiality,” Theoret. Comput. Sci., vol. 292, no. 1, pp. 45–63, 2003.
[56]
M.-P. Béal and D. Perrin, “A weak equivalence between shifts of finite type,” Adv. in Appl. Math., vol. 29, no. 2, pp. 162–171, 2002,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/faible.pdf
[57]
M.-P. Béal and D. Perrin, “On the enumerative sequences of regular languages on k symbols,” in STACS 2002, 2002, vol. 2285, pp. 547–558.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/stacsFinal.pdf
[58]
M.-P. Béal and O. Carton, “Determinization of transducers over finite and infinite words,” Theoret. Comput. Sci., vol. 289, no. 1, pp. 225–251, 2002,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/det1.pdf
[59]
F. Bassino, M.-P. Béal, and D. Perrin, “Length distributions and regular sequences,” in Codes, systems, and graphical models (minneapolis, MN, 1999), 2001, vol. 123, pp. 415–437.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/ActesIma.pdf
[60]
M.-P. Béal, “Codage symbolique,” PhD thesis, Université de Marne-la-Vallée, 2001.
[61]
M.-P. Béal and O. Carton, “Asynchronous sliding block maps,” in Developments in language theory (aachen, 1999), 2000, pp. 47–59.
[62]
M.-P. Béal and O. Carton, “Computing the prefix of an automaton,” Theor. Inform. Appl., vol. 34, no. 6, pp. 503–514, 2000,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/prefix.pdf
[63]
M.-P. Béal and O. Carton, “Determinization of transducers over infinite words,” in ICALP 2000), 2000, vol. 1853, pp. 561–570.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/icalp00.pdf
[64]
M.-P. Béal, O. Carton, C. Prieur, and J. Sakarovitch, “Squaring transducers: An efficient procedure for deciding functionality and sequentiality,” in LATIN’2000, 2000, vol. 1776.
[65]
M.-P. Béal, F. Mignosi, A. Restivo, and M. Sciortino, “Forbidden words in symbolic dynamics,” Adv. in Appl. Math., vol. 25, no. 2, pp. 163–193, 2000,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/forbiddenWords.pdf
[66]
M.-P. Béal and O. Carton, “Asynchronous sliding block maps,” Theor. Inform. Appl., vol. 34, no. 2, pp. 139–156, 2000.
[67]
F. Bassino, M.-P. Béal, and D. Perrin, “A finite state version of the Kraft-McMillan theorem,” SIAM J. Comput., vol. 30, no. 4, pp. 1211–1230 (electronic), 2000,Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/siamfinal.pdf
[68]
F. Bassino, M.-P. Béal, and D. Perrin, “Enumerative sequences of leaves and nodes in rational trees,” Theoret. Comput. Sci., vol. 221, no. 1–2, pp. 41–60, 1999,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/serielong.pdf
[69]
M.-P. Béal, “On rotationally invariant codes,” Institut Gaspard-Monge, 98-13, 1998.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/rotation.pdf
[70]
F. Bassino, M.-P. Béal, and D. Perrin, “Super-state automata and rational trees,” in LATIN’98: Theoretical informatics (campinas, 1998), 1998, vol. 1380, pp. 42–52.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/latin.pdf
[71]
M.-P. Béal and J. Senellart, “On the bound of the synchronization delay of a local automaton,” Theoret. Comput. Sci., vol. 205, no. 1–2, pp. 297–306, 1998,Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/echelle.pdf
[72]
F. Bassino, M.-P. Béal, and D. Perrin, “Enumerative sequences of leaves in rational trees,” in ICALP’97: Automata, languages and programming (bologna, 1997), 1997, vol. 1256, pp. 76–86.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/ical97.pdf
[73]
M.-P. Béal and D. Perrin, “Symbolic dynamics and finite automata,” in Handbook of formal languages, vol. 2, Berlin: Springer, 1997, pp. 463–505.Available: http://igm.univ-mlv.fr/~beal/Recherche/Publications/miseAJourHandbook.pdf
[74]
M.-P. Béal, O. Carton, and C. Reutenauer, “Cyclic languages and strongly cyclic languages,” in STACS 96 (grenoble, 1996), 1996, vol. 1046, pp. 49–59.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/cycliques.pdf
[75]
M.-P. Béal, F. Mignosi, and A. Restivo, “Minimal forbidden words and symbolic dynamics,” in STACS 96 (grenoble, 1996), 1996, vol. 1046, pp. 555–566.Available: http://www-igm.univ-mlv.fr/~beal/Recherche/Publications/mignosi_stacs2.pdf
[76]
M.-P. Béal, “Puissance extérieure d’un automate déterministe, application au calcul de la fonction zêta d’un système sofique,” RAIRO Inform. Théor. Appl., vol. 29, no. 2, pp. 85–103, 1995.
[77]
J. Ashley and M.-P. Béal, “A note on the method of poles for code construction,” IEEE Trans. Inform. Theory, vol. 40, no. 2, pp. 512–517, 1994.
[78]
M.-P. Béal, Codage symbolique. Masson, 1993.
[79]
J. Ashley and M.-P. Béal, “Codage dans certains systèmes dynamiques symboliques,” in Actes des journées montoises 1990, 1990, pp. 1–4.
[80]
M.-P. Béal, “The method of poles: A coding method for constrained channels,” IEEE Trans. Inform. Theory, vol. 36, no. 4, pp. 763–772, 1990.
[81]
M.-P. Béal, “Codes circulaires, automates locaux et entropie,” Theoret. Comput. Sci., vol. 57, no. 2–3, pp. 283–302, 1988.
[82]
M.-P. Béal, “Au sujet du premier théorème d’Adler sur l’équivalence de deux systèmes de type fini de même entropie,” LITP, 88-38, 1988.
[83]
M.-P. Béal, “Codage, automates locaux et entropie,” Thesis, Université Paris 7, 1987.
[84]
M.-P. Béal and D. Perrin, “Une caractérisation des ensembles sofiques,” C. R. Acad. Sci. Paris Sér. I Math., vol. 303, no. 6, pp. 255–257, 1986.