Michel Latteux

According to our database1, Michel Latteux
  • authored at least 72 papers between 1975 and 2015.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 


On csauthors.net:


A canonical automaton for one-rule length-preserving string rewrite systems.
Inf. Comput., 2015

One-Rule Length-Preserving Rewrite Systems and Rational Transductions.
RAIRO - Theor. Inf. and Applic., 2014

On One-Rule Grid Semi-Thue Systems.
Fundam. Inform., 2012

Minimal NFA and biRFSA Languages.
ITA, 2009

Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci., 2007

Identification of biRFSA languages.
Theor. Comput. Sci., 2006

Commutation with codes.
Theor. Comput. Sci., 2005

Mixed languages.
Theor. Comput. Sci., 2005

Commutation with Ternary Sets of Words.
Theory Comput. Syst., 2005

Equality sets for recursively enumerable languages.
ITA, 2005

Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett., 2005

Representation of Regular Languages by Equality Sets.
Bulletin of the EATCS, 2005

Valence Languages Generated by Equality Sets.
Journal of Automata, Languages and Combinatorics, 2004

The Commutation with Codes and Ternary Sets of Words.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Languages Defined by Generalized Equality Sets.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Synchronized Shuffle and Regular Languages.
Proceedings of the Jewels are Forever, 1999

The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci., 1998

Iterated Length-Preserving Rational Transductions.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Recognizable Picture Languages and Domino Tiling.
Theor. Comput. Sci., 1997

Context-Sensitive String Languages and Eecognizable Picture Languages.
Inf. Comput., 1997

Constructing Sequential Bijections.
Proceedings of the Structures in Logic and Computer Science, 1997

On Computational Power of Weighted Finite Automata.
Fundam. Inform., 1996

Variable-Length Maximal Codes.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Representation of Rational Functions with Prefix and Suffix Codings.
Theor. Comput. Sci., 1994

On Continuous Functions Computed by Finite Automata.
ITA, 1994

Codes and Infinite Words.
Acta Cybern., 1994

Compositional representation of rational functions.
ITA, 1992

Deterministic Sequential Functions.
Acta Inf., 1992

On Computational Power of Weighted Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

A Decidability Result about Convex Polyominoes.
Proceedings of the LATIN '92, 1992

On Characterizations of Recursively Enumerable Languages.
Acta Inf., 1990

Rational omega-Transductions.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Decomposition of Partial Commutations.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Motifs Et Bases De Langages.
ITA, 1989

2-Asynchronous Automata.
Theor. Comput. Sci., 1988

Bifaithful Starry Transductions.
Inf. Process. Lett., 1988

Rational Cones and Commutations.
Proceedings of the Machines, 1988

Inf. Comput., April, 1987

A New Normal Form for the Compositions of Morphisms and Inverse Morphisms.
Mathematical Systems Theory, 1987

On Commutative Context-Free Languages.
J. Comput. Syst. Sci., 1987

Sur Les Ensembles Linéaires.
ITA, 1987

Two Characterizations of Rational Adherences.
Theor. Comput. Sci., 1986

Finitely Generated (Omega)o-Languages.
Inf. Process. Lett., 1986

On the Usefulness of Bifaithful Rational Cones.
Mathematical Systems Theory, 1985

The Family of One-Counter Languages is Closed Under Quotient.
Acta Inf., 1985

Partial Commutations and Faithful Rational Transductions.
Theor. Comput. Sci., 1984

Commutative One-Counter Languages are Regular.
J. Comput. Syst. Sci., 1984

On Bounded Context-free Languages.
Elektronische Informationsverarbeitung und Kybernetik, 1984

Langages à un Compteur.
J. Comput. Syst. Sci., 1983

On a Language Without Star.
Inf. Process. Lett., 1983

On the Composition of Morphisms and Inverse Morphisms.
Proceedings of the Automata, 1983

Indécidabilité de la Condition IRS.
ITA, 1982

Substitution of Bounded Rational Cone
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Languages albébriques dominés par des langages unaires
Information and Control, January, 1981

A Propos du Lemme de Substitution.
Theor. Comput. Sci., 1981

The Inclusion of D0L in MULTI-RESET.
Inf. Process. Lett., 1981

Quelques propriétés des langages à un Comptuer.
Proceedings of the Theoretical Computer Science, 1981

Parikh-Bounded Languages.
Proceedings of the Automata, 1981

Transduction rationnelle, substitution et complémentaire
Information and Control, June, 1980

Sur les générateurs algébriques et linéaires.
Acta Inf., 1980

Substitutions dans le EDTOL Systèmes Ultralinéaires
Information and Control, August, 1979

A New Proof of two Theorems about Rational Transductions.
Theor. Comput. Sci., 1979

Cônes rationnels commutatifs.
J. Comput. Syst. Sci., 1979

Intersections de langages algébriques bornés.
Acta Inf., 1979

Sur deux langages linéaires.
Proceedings of the Theoretical Computer Science, 1979

Une propriete de la famille GRE.
FCT, 1979

Une Note sur la Propriété de Prefixe.
Mathematical Systems Theory, 1978

Mots infinis et langages commutatifs.
ITA, 1978

Produit dans le Cône Rationnel Engendré par D.
Theor. Comput. Sci., 1977

Cônes Rationnels Commutativement Clos.
ITA, 1977

Problems decidables concernant les tol-langages unaires.
Discrete Mathematics, 1977

Sur les TOL - Systemes Unaires.
ITA, 1975