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