All
Books
| 2013 | |
| [2] | 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. |
| 1993 | |
| [1] | Codage symbolique (), Masson, 1993. |
Book Chapters
| 2021 | |
| [3] | Symbolic Dynamics (), Chapter in Handbook of Automata Theory (Jean-Éric Pin, ed.), EMS Press, volume II, 2021. |
| 2010 | |
| [2] | Variable-length codes and finite automata (), Chapter in Selected topics in information and coding theory (Issac Woungang, Sudip Misra, Subhas Chandra Misra, ed.), World Scientific Publishing Company, 2010. |
| 1997 | |
| [1] | Symbolic dynamics and finite automata (), Chapter in Handbook of formal languages, Vol. 2, Springer, 1997. |
Refereed Articles
| 2025 | |
| [43] | Recognizability in S-adic shifts (), In Israel. J. Math., 2025. |
| [42] | Checking and producing word attractors (), In arXiv, 2025. |
| 2024 | |
| [41] | Decidable problems in substitution shifts (), In J. Comput. Syst. Sci., volume 143, 2024. |
| 2023 | |
| [40] | Unambiguously coded systems (), In European Journal of Combinatorics, 2023. |
| [39] | Recognizability of morphisms (), In Erg. Theor. & Dyn. Sys., Cambridge University Press, volume 43, 2023. |
| 2022 | |
| [38] | Checking whether a word is Hamming-isometric in linear time (), In Theor. Comput. Sci., 2022. |
| 2017 | |
| [37] | Shifts of k-nested sequences (), In Theor. Comput. Sci., volume 658, 2017. |
| 2016 | |
| [36] | Sofic-Dyck shifts (), In Theor. Comput. Sci., volume 609, 2016. |
| 2014 | |
| [35] | Tree algebra of sofic tree languages (), In RAIRO - Theor. Inf. and Applic., volume 48, 2014. |
| [34] | A quadratic algorithm for road coloring (), In Discrete Applied Mathematics, volume 169, 2014. |
| 2013 | |
| [33] | Sofic Tree-Shifts (), In Theory Comput. Syst., 2013. |
| 2012 | |
| [32] | Tree-shifts of finite type (), In Theoret. Comput. Sci., volume 459, 2012. |
| 2011 | |
| [31] | Periodic-Finite-Type Shift Spaces (), In IEEE Trans. Inform. Theory, volume 57, 2011. |
| [30] | A quadratic upper bound on the size of a synchronizing word in one-cluster automata (), In Int. J. Found. Comput. Sci., volume 22, 2011. |
| 2010 | |
| [29] | Embeddings of local automata (), In Illinois J. Math., volume 54, 2010. |
| 2009 | |
| [28] | Completing codes in a sofic shift (), In Theoret. Comput. Science, volume 410, 2009. |
| [27] | Coding partitions of regular sets (), In Internat. J. Algebra Comput., volume 19, 2009. |
| 2008 | |
| [26] | Unambiguous automata (), In Mathematics in Computer Science, volume 1, 2008. |
| 2006 | |
| [25] | Codes, unambiguous automata and sofic systems (), In Theoret. Comput. Sci., volume 356, 2006. |
| [24] | The syntactic graph of a sofic shift is invariant under shift equivalence (), In Internat. J. Algebra Comput., volume 16, 2006. |
| 2005 | |
| [23] | Codes and sofic constraints (), In Theoret. Comput. Sci., volume 340, 2005. |
| [22] | A hierarchy of shift equivalent sofic shifts (), In Theoret. Comput. Sci., volume 345, 2005. |
| [21] | Minimal forbidden patterns of multi-dimensional shifts (), In Internat. J. Algebra Comput., volume 15, 2005. |
| [20] | Presentations of constrained systems with unconstrained positions (), In IEEE Trans. Inform. Theory, volume 41, 2005. |
| 2004 | |
| [19] | Determinization of transducers over infinite words: the general case (), In Theory Comput. Syst., volume 37, 2004. |
| [18] | An algorithmic view of gene teams (), In Theoret. Comput. Sci., volume 320, 2004. |
| 2003 | |
| [17] | On the generating sequences of regular languages on $k$-symbols (), In J. ACM, volume 50, 2003. |
| [16] | Computing forbidden words of regular languages (), In Fund. Inform., volume 56, 2003. |
| [15] | Squaring transducers: an efficient procedure for deciding functionality and sequentiality (), In Theoret. Comput. Sci., volume 292, 2003. |
| [14] | Extensions of the method of poles for code construction (), In IEEE Trans. Inform. Theory, volume 49, 2003. |
| 2002 | |
| [13] | A weak equivalence between shifts of finite type (), In Adv. in Appl. Math., volume 29, 2002. |
| [12] | Determinization of transducers over finite and infinite words (), In Theoret. Comput. Sci., volume 289, 2002. |
| 2000 | |
| [11] | Forbidden words in symbolic dynamics (), In Adv. in Appl. Math., volume 25, 2000. |
| [10] | Asynchronous sliding block maps (), In Theor. Inform. Appl., volume 34, 2000. |
| [9] | Computing the prefix of an automaton (), In Theor. Inform. Appl., volume 34, 2000. |
| [8] | A finite state version of the Kraft-McMillan theorem (), In SIAM J. Comput., volume 30, 2000. |
| 1999 | |
| [7] | Enumerative sequences of leaves and nodes in rational trees (), In Theoret. Comput. Sci., volume 221, 1999. |
| 1998 | |
| [6] | On the bound of the synchronization delay of a local automaton (), In Theoret. Comput. Sci., volume 205, 1998. |
| 1995 | |
| [5] | Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique (), In RAIRO Inform. Théor. Appl., volume 29, 1995. |
| 1994 | |
| [4] | A note on the method of poles for code construction (), In IEEE Trans. Inform. Theory, volume 40, 1994. |
| 1990 | |
| [3] | The method of poles: a coding method for constrained channels (), In IEEE Trans. Inform. Theory, volume 36, 1990. |
| 1988 | |
| [2] | Codes circulaires, automates locaux et entropie (), In Theoret. Comput. Sci., volume 57, 1988. |
| 1986 | |
| [1] | Une caractérisation des ensembles sofiques (), In C. R. Acad. Sci. Paris Sér. I Math., volume 303, 1986. |
Refereed Conference Papers
| 2025 | |
| [28] | Specific Patterns Against Reference Sequences (), In From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday (Conte, Alessio, Marino, Andrea, Rosone, Giovanna, Vitter, Jeffrey Scott, eds.), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, volume 132, 2025. |
| 2023 | |
| [27] | Fast detection of specific fragments against a set of sequences (), In 27th International Conference on Developments in Language Theory, DLT 2023, volume 13911, 2023. |
| 2017 | |
| [26] | 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 (Pascal Weil, ed.), Springer, volume 10304, 2017. |
| 2014 | |
| [25] | 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. |
| 2012 | |
| [24] | Toward a Timed Theory of Channel Coding (), In FORMATS, 2012. |
| [23] | Decidability of geometricity of regular languages (), In Developments in Language Theory, 2012. |
| 2010 | |
| [22] | 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, Springer, volume 6072, 2010. |
| 2009 | |
| [21] | Decidability of conjugacy of tree shifts of finite type (), In 36th International Colloquium on Automata, Languages and Programming (ICALP'09), Springer-Verlag, volume 5555, 2009. |
| [20] | A quadratic upper bound on the size of a synchronizing word in one-Cluster automata (), In Developments in Language Theory, 2009. |
| 2008 | |
| [19] | Minimizing incomplete automata (), In Finite-State Methods and Natural Language Processing (FSMNLP'08), 2008. |
| [18] | Embeddings of local automata (), In 2008 IEEE International Symposium on Information Theory, ISIT 2008, 2008. |
| 2007 | |
| [17] | Minimizing local automata (), In 2007 IEEE International Symposium on Information Theory, ISIT 2007, 2007. |
| [16] | Coding partitions: regularity, maximality, and global ambiguity (), 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. |
| 2006 | |
| [15] | Complete codes in a sofic shift (), In STACS 2006, Springer, volume 3884, 2006. |
| [14] | Conjugacy and equivalence of weighted automata and functional transducers (), In Computer Science - Theory and Applications (CSR'06), Springer, volume 3967, 2006. |
| 2005 | |
| [13] | On the equivalence of $\mathbb{Z}$-automata (), In Automata, languages and programming (ICALP, 2005), Springer, volume 3580, 2005. |
| 2004 | |
| [12] | The syntactic graph of a sofic shift (), In STACS 2004, Springer, volume 2996, 2004. |
| [11] | A hierarchy of irreducible sofic shifts (), In Mathematical foundations of computer science MFCS'04, Springer, volume 3153, 2004. |
| 2002 | |
| [10] | On the enumerative sequences of regular languages on $k$ symbols (), In STACS 2002 (H. Alt, A. Ferreira, eds.), Springer, volume 2285, 2002. |
| 2001 | |
| [9] | Length distributions and regular sequences (), In Codes, systems, and graphical models (Minneapolis, MN, 1999) (Joachim Rosenthal, Brian Marcus, eds.), Springer, volume 123, 2001. |
| 2000 | |
| [8] | Squaring transducers: An efficient procedure for deciding functionality and sequentiality (), In LATIN'2000 (G. Gonnet, D. Panario, A. Viola, eds.), Springer, volume 1776, 2000. |
| [7] | Determinization of transducers over infinite words (), In ICALP 2000) (U. Montanari, others, eds.), Springer, volume 1853, 2000. |
| [6] | Asynchronous sliding block maps (), In Developments in language theory (Aachen, 1999), World Sci. Publishing, 2000. |
| 1998 | |
| [5] | Super-state automata and rational trees (), In LATIN'98: theoretical informatics (Campinas, 1998), Springer, volume 1380, 1998. |
| 1997 | |
| [4] | Enumerative sequences of leaves in rational trees (), In ICALP'97: Automata, languages and programming (Bologna, 1997), Springer, volume 1256, 1997. |
| 1996 | |
| [3] | Minimal forbidden words and symbolic dynamics (), In STACS 96 (Grenoble, 1996), Springer, volume 1046, 1996. |
| [2] | Cyclic languages and strongly cyclic languages (), In STACS 96 (Grenoble, 1996), Springer, volume 1046, 1996. |
| 1990 | |
| [1] | Codage dans certains systèmes dynamiques symboliques (), In Actes des Journées Montoises 1990, Université de Mons-Hainaut, 1990. |
Refereed Workshop Papers
| 2014 | |
| [1] | 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. |
Other Publications
| 2022 | |
| [5] | A note on one-sided recognizable morphisms (), volume abs/2110.10267, 2022. |
| 2001 | |
| [4] | Codage symbolique (), PhD thesis, Université de Marne-la-Vallée, 2001. |
| 1998 | |
| [3] | On rotationally invariant codes (), Technical report 98-13, Institut Gaspard-Monge, 1998. |
| 1988 | |
| [2] | Au sujet du premier théorème d'Adler sur l'équivalence de deux systèmes de type fini de même entropie (), Technical report 88-38, LITP, 1988. |
| 1987 | |
| [1] | Codage, automates locaux et entropie (), PhD thesis, Université Paris 7, 1987. |