Sur les TOL - Systemes Unaires. - Michel Latteux (RAIRO Theor. Informatics Appl., 1975)

Problems decidables concernant les tol-langages unaires. - Michel Latteux (Discret. Math., 1977)

Cônes Rationnels Commutativement Clos. - Michel Latteux (RAIRO Theor. Informatics Appl., 1977)

Produit dans le Cône Rationnel Engendré par D. - Michel Latteux (Theor. Comput. Sci., 1977)

Mots infinis et langages commutatifs. - Michel Latteux (RAIRO Theor. Informatics Appl., 1978)

Une Note sur la Propriété de Prefixe. - Michel Latteux (Math. Syst. Theory, 1978)

Une propriete de la famille GRE. - Michel Latteux; Jeannine Leguy (FCT, 1979)

Sur deux langages linéaires. - Michel Latteux (Theoretical Computer Science, 1979)

Intersections de langages algébriques bornés. - Michel Latteux (Acta Informatica, 1979)

Cônes rationnels commutatifs. - Michel Latteux (J. Comput. Syst. Sci., 1979)

A New Proof of two Theorems about Rational Transductions. - André Arnold; Michel Latteux (Theor. Comput. Sci., 1979)

Substitutions dans le EDTOL Systèmes Ultralinéaires - Michel Latteux (Inf. Control., 1979)

Sur les générateurs algébriques et linéaires. - Michel Latteux (Acta Informatica, 1980)

Transduction rationnelle, substitution et complémentaire - Michel Latteux (Inf. Control., 1980)

Parikh-Bounded Languages. - Meera Blattner; Michel Latteux (ICALP, 1981)

Quelques propriétés des langages à un Comptuer. - Michel Latteux (Theoretical Computer Science, 1981)

The Inclusion of D0L in MULTI-RESET. - Mireille Clerbout; Michel Latteux (Inf. Process. Lett., 1981)

A Propos du Lemme de Substitution. - Michel Latteux (Theor. Comput. Sci., 1981)

Languages albébriques dominés par des langages unaires - Jean-Michel Autebert; Joffroy Beauquier; Luc Boasson; Michel Latteux (Inf. Control., 1981)

Substitution of Bounded Rational Cone - Joffroy Beauquier; Michel Latteux (FOCS, 1982)

Indécidabilité de la Condition IRS. - Jean-Michel Autebert; Joffroy Beauquier; Luc Boasson; Michel Latteux (RAIRO Theor. Informatics Appl., 1982)

On the Composition of Morphisms and Inverse Morphisms. - Michel Latteux; Jeannine Leguy (ICALP, 1983)

On a Language Without Star. - Michel Latteux (Inf. Process. Lett., 1983)

Langages à un Compteur. - Michel Latteux (J. Comput. Syst. Sci., 1983)

On Bounded Context-free Languages. - Michel Latteux; Gabriel Thierrin (J. Inf. Process. Cybern., 1984)

Commutative One-Counter Languages are Regular. - Michel Latteux; Grzegorz Rozenberg (J. Comput. Syst. Sci., 1984)

Partial Commutations and Faithful Rational Transductions. - Mireille Clerbout; Michel Latteux (Theor. Comput. Sci., 1984)

The Family of One-Counter Languages is Closed Under Quotient. - Michel Latteux; B. Leguy; B. Ratoandromanana (Acta Informatica, 1985)

On the Usefulness of Bifaithful Rational Cones. - Michel Latteux; Jeannine Leguy (Math. Syst. Theory, 1985)

Finitely Generated (Omega)o-Languages. - Michel Latteux; Erick Timmerman (Inf. Process. Lett., 1986)

Two Characterizations of Rational Adherences. - Michel Latteux; Erick Timmerman (Theor. Comput. Sci., 1986)

Sur Les Ensembles Linéaires. - Michel Latteux (RAIRO Theor. Informatics Appl., 1987)

On Commutative Context-Free Languages. - Joffroy Beauquier; Meera Blattner; Michel Latteux (J. Comput. Syst. Sci., 1987)

A New Normal Form for the Compositions of Morphisms and Inverse Morphisms. - Michel Latteux; Paavo Turakainen (Math. Syst. Theory, 1987)

Semi-commutations - Mireille Clerbout; Michel Latteux (Inf. Comput., 1987)

Rational Cones and Commutations. - Michel Latteux (IMYCS, 1988)

Bifaithful Starry Transductions. - Michel Latteux; Erick Timmerman (Inf. Process. Lett., 1988)

2-Asynchronous Automata. - Robert Cori; Éric Sopena; Michel Latteux; Yves Roos (Theor. Comput. Sci., 1988)

Motifs Et Bases De Langages. - Jean-Michel Autebert; Luc Boasson; Michel Latteux (RAIRO Theor. Informatics Appl., 1989)

Decomposition of Partial Commutations. - Mireille Clerbout; Michel Latteux; Yves Roos (ICALP, 1990)

Rational omega-Transductions. - Michel Latteux; Erick Timmerman (MFCS, 1990)

On Characterizations of Recursively Enumerable Languages. - Michel Latteux; Paavo Turakainen (Acta Informatica, 1990)

A Decidability Result about Convex Polyominoes. - Danièle Beauquier; Michel Latteux; Karine Slowinski (LATIN, 1992)

Deterministic Sequential Functions. - Tero Harju; H. C. M. Kleijn; Michel Latteux (Acta Informatica, 1992)

Compositional representation of rational functions. - Tero Harju; H. C. M. Kleijn; Michel Latteux (RAIRO Theor. Informatics Appl., 1992)

Codes and Infinite Words. - Jeanne Devolder; Michel Latteux; Igor Litovsky; Ludwig Staiger (Acta Cybern., 1994)

On Continuous Functions Computed by Finite Automata. - Denis Derencourt; Juhani Karhumäki; Michel Latteux; Alain Terlutte (RAIRO Theor. Informatics Appl., 1994)

Representation of Rational Functions with Prefix and Suffix Codings. - Tero Harju; H. C. M. Kleijn; Michel Latteux; Alain Terlutte (Theor. Comput. Sci., 1994)

Semi-Commutations. - Mireille Clerbout; Michel Latteux; Yves Roos (The Book of Traces, 1995)

Variable-Length Maximal Codes. - Véronique Bruyère; Michel Latteux (ICALP, 1996)

On Computational Power of Weighted Finite Automata. - Denis Derencourt; Juhani Karhumäki; Michel Latteux; Alain Terlutte (Fundam. Informaticae, 1996)

Constructing Sequential Bijections. - Christophe Prieur 002; Christian Choffrut; Michel Latteux (Structures in Logic and Computer Science, 1997)

Context-Sensitive String Languages and Eecognizable Picture Languages. - Michel Latteux; David Simplot (Inf. Comput., 1997)

Recognizable Picture Languages and Domino Tiling. - Michel Latteux; David Simplot (Theor. Comput. Sci., 1997)

Iterated Length-Preserving Rational Transductions. - Michel Latteux; David Simplot; Alain Terlutte (MFCS, 1998)

The Meet Operation in the Lattice of Codes. - Véronique Bruyère; Denis Derencourt; Michel Latteux (Theor. Comput. Sci., 1998)

Synchronized Shuffle and Regular Languages. - Michel Latteux; Yves Roos (Jewels are Forever, 1999)

Languages Defined by Generalized Equality Sets. - Vesa Halava; Tero Harju; Hendrik Jan Hoogeboom; Michel Latteux (FCT, 2003)

The Commutation with Codes and Ternary Sets of Words. - Juhani Karhumäki; Michel Latteux; Ion Petre (STACS, 2003)

Valence Languages Generated by Equality Sets. - Vesa Halava; Tero Harju; Hendrik Jan Hoogeboom; Michel Latteux (J. Autom. Lang. Comb., 2004)

Representation of Regular Languages by Equality Sets. - Vesa Halava; Tero Harju; Michel Latteux (Bull. EATCS, 2005)

Equality sets of prefix morphisms and regular star languages. - Vesa Halava; Tero Harju; Michel Latteux (Inf. Process. Lett., 2005)

Equality sets for recursively enumerable languages. - Vesa Halava; Tero Harju; Hendrik Jan Hoogeboom; Michel Latteux (RAIRO Theor. Informatics Appl., 2005)

Commutation with Ternary Sets of Words. - Juhani Karhumäki; Michel Latteux; Ion Petre (Theory Comput. Syst., 2005)

Mixed languages. - Jean Berstel; Luc Boasson; Michel Latteux (Theor. Comput. Sci., 2005)

Commutation with codes. - Juhani Karhumäki; Michel Latteux; Ion Petre (Theor. Comput. Sci., 2005)

Identification of biRFSA languages. - Michel Latteux; Aurélien Lemay; Yves Roos; Alain Terlutte (Theor. Comput. Sci., 2006)

Extension of the decidability of the marked PCP to instances with unique blocks. - Vesa Halava; Tero Harju; Juhani Karhumäki; Michel Latteux (Theor. Comput. Sci., 2007)

Minimal NFA and biRFSA Languages. - Michel Latteux; Yves Roos; Alain Terlutte (RAIRO Theor. Informatics Appl., 2009)

On One-Rule Grid Semi-Thue Systems. - Michel Latteux; Yves Roos (Fundam. Informaticae, 2012)

One-Rule Length-Preserving Rewrite Systems and Rational Transductions. - Michel Latteux; Yves Roos (RAIRO Theor. Informatics Appl., 2014)

A canonical automaton for one-rule length-preserving string rewrite systems. - Michel Latteux; Yves Roos (Inf. Comput., 2015)

On prefixal one-rule string rewrite systems. - Michel Latteux; Yves Roos (Theor. Comput. Sci., 2019)

On rationally controlled one-rule insertion systems. - Michel Latteux; Yves Roos (RAIRO Theor. Informatics Appl., 2022)