Michel Latteux

Publication Activity (10 Years)

Years Active: 1975-2022
Publications (10 Years): 2

Top Topics

Finite Automata

Top Venues

RAIRO Theor. Informatics Appl.

Theor. Comput. Sci.

Publications

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