Michel Latteux

75 papers A* 5A 1B 6Journal 57Unranked 5
YearRankTypeTitle / Venue / Authors
2022 J jnl
On rationally controlled one-rule insertion systems.
RAIRO Theor. Informatics Appl.
Michel Latteux, Yves Roos
2019 J jnl
On prefixal one-rule string rewrite systems.
Theor. Comput. Sci.
Michel Latteux, Yves Roos
2015 J jnl
A canonical automaton for one-rule length-preserving string rewrite systems.
Inf. Comput.
Michel Latteux, Yves Roos
2014 J jnl
One-Rule Length-Preserving Rewrite Systems and Rational Transductions.
RAIRO Theor. Informatics Appl.
Michel Latteux, Yves Roos
2012 J jnl
On One-Rule Grid Semi-Thue Systems.
Fundam. Informaticae
Michel Latteux, Yves Roos
2009 J jnl
Minimal NFA and biRFSA Languages.
RAIRO Theor. Informatics Appl.
Michel Latteux, Yves Roos, Alain Terlutte
2007 J jnl
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
2006 J jnl
Identification of biRFSA languages.
Theor. Comput. Sci.
Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
2005 J jnl
Commutation with Ternary Sets of Words.
Theory Comput. Syst.
Juhani Karhumäki, Michel Latteux, Ion Petre
2005 J jnl
Commutation with codes.
Theor. Comput. Sci.
Juhani Karhumäki, Michel Latteux, Ion Petre
2005 J jnl
Equality sets for recursively enumerable languages.
RAIRO Theor. Informatics Appl.
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2005 J jnl
Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett.
Vesa Halava, Tero Harju, Michel Latteux
2005 J jnl
Mixed languages.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Michel Latteux
2005 J jnl
Representation of Regular Languages by Equality Sets.
Bull. EATCS
Vesa Halava, Tero Harju, Michel Latteux
2004 J jnl
Valence Languages Generated by Equality Sets.
J. Autom. Lang. Comb.
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2003 B conf
Languages Defined by Generalized Equality Sets.
FCT
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2003 A conf
The Commutation with Codes and Ternary Sets of Words.
STACS
Juhani Karhumäki, Michel Latteux, Ion Petre
1999 — conf
Synchronized Shuffle and Regular Languages.
Jewels are Forever
Michel Latteux, Yves Roos
1998 B conf
Iterated Length-Preserving Rational Transductions.
MFCS
Michel Latteux, David Simplot, Alain Terlutte
1998 J jnl
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci.
Véronique Bruyère, Denis Derencourt, Michel Latteux
1997 — conf
Constructing Sequential Bijections.
Structures in Logic and Computer Science
Christophe Prieur, Christian Choffrut, Michel Latteux
1997 J jnl
Context-Sensitive String Languages and Eecognizable Picture Languages.
Inf. Comput.
Michel Latteux, David Simplot
1997 J jnl
Recognizable Picture Languages and Domino Tiling.
Theor. Comput. Sci.
Michel Latteux, David Simplot
1996 J jnl
On Computational Power of Weighted Finite Automata.
Fundam. Informaticae
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1996 A* conf
Variable-Length Maximal Codes.
ICALP
Véronique Bruyère, Michel Latteux
1995 — ch.
Semi-Commutations.
The Book of Traces
Mireille Clerbout, Michel Latteux, Yves Roos
1994 J jnl
Codes and Infinite Words.
Acta Cybern.
Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger
1994 J jnl
On Continuous Functions Computed by Finite Automata.
RAIRO Theor. Informatics Appl.
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1994 J jnl
Representation of Rational Functions with Prefix and Suffix Codings.
Theor. Comput. Sci.
Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte
1992 B conf
A Decidability Result about Convex Polyominoes.
LATIN
Danièle Beauquier, Michel Latteux, Karine Slowinski
1992 J jnl
Compositional representation of rational functions.
RAIRO Theor. Informatics Appl.
Tero Harju, H. C. M. Kleijn, Michel Latteux
1992 J jnl
Deterministic Sequential Functions.
Acta Informatica
Tero Harju, H. C. M. Kleijn, Michel Latteux
1992 B conf
On Computational Power of Weighted Finite Automata.
MFCS
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1990 A* conf
Decomposition of Partial Commutations.
ICALP
Mireille Clerbout, Michel Latteux, Yves Roos
1990 J jnl
On Characterizations of Recursively Enumerable Languages.
Acta Informatica
Michel Latteux, Paavo Turakainen
1990 B conf
Rational omega-Transductions.
MFCS
Michel Latteux, Erick Timmerman
1989 J jnl
Motifs Et Bases De Langages.
RAIRO Theor. Informatics Appl.
Jean-Michel Autebert, Luc Boasson, Michel Latteux
1988 J jnl
2-Asynchronous Automata.
Theor. Comput. Sci.
Robert Cori, Éric Sopena, Michel Latteux, Yves Roos
1988 J jnl
Bifaithful Starry Transductions.
Inf. Process. Lett.
Michel Latteux, Erick Timmerman
1988 — conf
Rational Cones and Commutations.
IMYCS
Michel Latteux
1987 J jnl
A New Normal Form for the Compositions of Morphisms and Inverse Morphisms.
Math. Syst. Theory
Michel Latteux, Paavo Turakainen
1987 J jnl
On Commutative Context-Free Languages.
J. Comput. Syst. Sci.
Joffroy Beauquier, Meera Blattner, Michel Latteux
1987 J jnl
Semi-commutations
Inf. Comput.
Mireille Clerbout, Michel Latteux
1987 J jnl
Sur Les Ensembles Linéaires.
RAIRO Theor. Informatics Appl.
Michel Latteux
1986 J jnl
Finitely Generated (Omega)o-Languages.
Inf. Process. Lett.
Michel Latteux, Erick Timmerman
1986 J jnl
Two Characterizations of Rational Adherences.
Theor. Comput. Sci.
Michel Latteux, Erick Timmerman
1985 J jnl
On the Usefulness of Bifaithful Rational Cones.
Math. Syst. Theory
Michel Latteux, Jeannine Leguy
1985 J jnl
The Family of One-Counter Languages is Closed Under Quotient.
Acta Informatica
Michel Latteux, B. Leguy, B. Ratoandromanana
1984 J jnl
Commutative One-Counter Languages are Regular.
J. Comput. Syst. Sci.
Michel Latteux, Grzegorz Rozenberg
1984 J jnl
On Bounded Context-free Languages.
J. Inf. Process. Cybern.
Michel Latteux, Gabriel Thierrin
1984 J jnl
Partial Commutations and Faithful Rational Transductions.
Theor. Comput. Sci.
Mireille Clerbout, Michel Latteux
1983 J jnl
Langages à un Compteur.
J. Comput. Syst. Sci.
Michel Latteux
1983 J jnl
On a Language Without Star.
Inf. Process. Lett.
Michel Latteux
1983 A* conf
On the Composition of Morphisms and Inverse Morphisms.
ICALP
Michel Latteux, Jeannine Leguy
1982 J jnl
Indécidabilité de la Condition IRS.
RAIRO Theor. Informatics Appl.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux
1982 A* conf
Substitution of Bounded Rational Cone
FOCS
Joffroy Beauquier, Michel Latteux
1981 J jnl
A Propos du Lemme de Substitution.
Theor. Comput. Sci.
Michel Latteux
1981 J jnl
Languages albébriques dominés par des langages unaires
Inf. Control.
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux
1981 A* conf
Parikh-Bounded Languages.
ICALP
Meera Blattner, Michel Latteux
1981 — conf
Quelques propriétés des langages à un Comptuer.
Theoretical Computer Science
Michel Latteux
1981 J jnl
The Inclusion of D0L in MULTI-RESET.
Inf. Process. Lett.
Mireille Clerbout, Michel Latteux
1980 J jnl
Sur les générateurs algébriques et linéaires.
Acta Informatica
Michel Latteux
1980 J jnl
Transduction rationnelle, substitution et complémentaire
Inf. Control.
Michel Latteux
1979 J jnl
A New Proof of two Theorems about Rational Transductions.
Theor. Comput. Sci.
André Arnold, Michel Latteux
1979 J jnl
Cônes rationnels commutatifs.
J. Comput. Syst. Sci.
Michel Latteux
1979 J jnl
Intersections de langages algébriques bornés.
Acta Informatica
Michel Latteux
1979 J jnl
Substitutions dans le EDTOL Systèmes Ultralinéaires
Inf. Control.
Michel Latteux
1979 — conf
Sur deux langages linéaires.
Theoretical Computer Science
Michel Latteux
1979 B conf
Une propriete de la famille GRE.
FCT
Michel Latteux, Jeannine Leguy
1978 J jnl
Mots infinis et langages commutatifs.
RAIRO Theor. Informatics Appl.
Michel Latteux
1978 J jnl
Une Note sur la Propriété de Prefixe.
Math. Syst. Theory
Michel Latteux
1977 J jnl
Cônes Rationnels Commutativement Clos.
RAIRO Theor. Informatics Appl.
Michel Latteux
1977 J jnl
Problems decidables concernant les tol-langages unaires.
Discret. Math.
Michel Latteux
1977 J jnl
Produit dans le Cône Rationnel Engendré par
Theor. Comput. Sci.
Michel Latteux
1975 J jnl
Sur les TOL - Systemes Unaires.
RAIRO Theor. Informatics Appl.
Michel Latteux