| 2007 |
|---|
| 66 | EE | 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): 355-362 (2007) |
| 2006 |
|---|
| 65 | EE | Michel Latteux,
Aurélien Lemay,
Yves Roos,
Alain Terlutte:
Identification of biRFSA languages.
Theor. Comput. Sci. 356(1-2): 212-223 (2006) |
| 2005 |
|---|
| 64 | | Vesa Halava,
Tero Harju,
Michel Latteux:
Representation of Regular Languages by Equality Sets.
Bulletin of the EATCS 86: 224-228 (2005) |
| 63 | EE | Vesa Halava,
Tero Harju,
Michel Latteux:
Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett. 94(4): 151-154 (2005) |
| 62 | EE | Jean Berstel,
Luc Boasson,
Michel Latteux:
Mixed languages.
Theor. Comput. Sci. 332(1-3): 179-198 (2005) |
| 61 | EE | Juhani Karhumäki,
Michel Latteux,
Ion Petre:
Commutation with codes.
Theor. Comput. Sci. 340(1): 322-333 (2005) |
| 60 | EE | Juhani Karhumäki,
Michel Latteux,
Ion Petre:
Commutation with Ternary Sets of Words.
Theory Comput. Syst. 38(2): 161-169 (2005) |
| 2004 |
|---|
| 59 | | Michel Latteux:
Valence Languages Generated by Equality Sets.
Journal of Automata, Languages and Combinatorics 9(4): 399-406 (2004) |
| 2003 |
|---|
| 58 | EE | Vesa Halava,
Tero Harju,
Hendrik Jan Hoogeboom,
Michel Latteux:
Languages Defined by Generalized Equality Sets.
FCT 2003: 355-363 |
| 57 | EE | Juhani Karhumäki,
Michel Latteux,
Ion Petre:
The Commutation with Codes and Ternary Sets of Words.
STACS 2003: 74-84 |
| 1999 |
|---|
| 56 | | Michel Latteux,
Yves Roos:
Synchronized Shuffle and Regular Languages.
Jewels are Forever 1999: 35-44 |
| 1998 |
|---|
| 55 | EE | Michel Latteux,
David Simplot,
Alain Terlutte:
Iterated Length-Preserving Rational Transductions.
MFCS 1998: 286-295 |
| 54 | EE | Véronique Bruyère,
Denis Derencourt,
Michel Latteux:
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci. 191(1-2): 117-129 (1998) |
| 1997 |
|---|
| 53 | | Christophe Prieur,
Christian Choffrut,
Michel Latteux:
Constructing Sequential Bijections.
Structures in Logic and Computer Science 1997: 308-321 |
| 52 | | Michel Latteux,
David Simplot:
Context-Sensitive String Languages and Eecognizable Picture Languages.
Inf. Comput. 138(2): 160-169 (1997) |
| 51 | EE | Michel Latteux,
David Simplot:
Recognizable Picture Languages and Domino Tiling.
Theor. Comput. Sci. 178(1-2): 275-283 (1997) |
| 1996 |
|---|
| 50 | | Véronique Bruyère,
Michel Latteux:
Variable-Length Maximal Codes.
ICALP 1996: 24-47 |
| 49 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Computational Power of Weighted Finite Automata.
Fundam. Inform. 25(3): 285-293 (1996) |
| 1994 |
|---|
| 48 | EE | Jeanne Devolder,
Michel Latteux,
Igor Litovsky,
Ludwig Staiger:
Codes and Infinite Words.
Acta Cybern. 11(4): 241-256 (1994) |
| 47 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Continuous Functions Computed by Finite Automata.
ITA 28(3-4): 387-403 (1994) |
| 46 | | Tero Harju,
H. C. M. Kleijn,
Michel Latteux,
Alain Terlutte:
Representation of Rational Functions with Prefix and Suffix Codings.
Theor. Comput. Sci. 134(2): 403-413 (1994) |
| 1992 |
|---|
| 45 | | Danièle Beauquier,
Michel Latteux,
Karine Slowinski:
A Decidability Result about Convex Polyominoes.
LATIN 1992: 32-45 |
| 44 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Computational Power of Weighted Finite Automata.
MFCS 1992: 236-245 |
| 43 | | Tero Harju,
H. C. M. Kleijn,
Michel Latteux:
Deterministic Sequential Functions.
Acta Inf. 29(6/7): 545-554 (1992) |
| 42 | | Tero Harju,
H. C. M. Kleijn,
Michel Latteux:
Compositional representation of rational functions.
ITA 26: 243-256 (1992) |
| 1990 |
|---|
| 41 | | Mireille Clerbout,
Michel Latteux,
Yves Roos:
Decomposition of Partial Commutations.
ICALP 1990: 501-511 |
| 40 | | Michel Latteux,
Erick Timmerman:
Rational omega-Transductions.
MFCS 1990: 407-415 |
| 39 | | Michel Latteux,
Paavo Turakainen:
On Characterizations of Recursively Enumerable Languages.
Acta Inf. 28(2): 178-186 (1990) |
| 1989 |
|---|
| 38 | | Jean-Michel Autebert,
Luc Boasson,
Michel Latteux:
Motifs Et Bases De Langages.
ITA 23(4): 379-393 (1989) |
| 1988 |
|---|
| 37 | | Michel Latteux:
Rational Cones and Commutations.
IMYCS 1988: 37-54 |
| 36 | | Michel Latteux,
Erick Timmerman:
Bifaithful Starry Transductions.
Inf. Process. Lett. 28(1): 1-4 (1988) |
| 35 | | Robert Cori,
Eric Sopena,
Michel Latteux,
Yves Roos:
2-Asynchronous Automata.
Theor. Comput. Sci. 61: 93-102 (1988) |
| 1987 |
|---|
| 34 | | Michel Latteux:
Sur Les Ensembles Linéaires.
ITA 21(1): 33-40 (1987) |
| 33 | | Mireille Clerbout,
Michel Latteux:
Semi-commutations
Inf. Comput. 73(1): 59-74 (1987) |
| 32 | | Joffroy Beauquier,
Meera Blattner,
Michel Latteux:
On Commutative Context-Free Languages.
J. Comput. Syst. Sci. 35(3): 311-320 (1987) |
| 31 | | Michel Latteux,
Paavo Turakainen:
A New Normal Form for the Compositions of Morphisms and Inverse Morphisms.
Mathematical Systems Theory 20(4): 261-271 (1987) |
| 1986 |
|---|
| 30 | | Michel Latteux,
Erick Timmerman:
Finitely Generated (Omega)o-Languages.
Inf. Process. Lett. 23(4): 171-175 (1986) |
| 29 | | Michel Latteux,
Erick Timmerman:
Two Characterizations of Rational Adherences.
Theor. Comput. Sci. 46(3): 101-106 (1986) |
| 1985 |
|---|
| 28 | | Michel Latteux,
B. Leguy,
B. Ratoandromanana:
The Family of One-Counter Languages is Closed Under Quotient.
Acta Inf. 22(5): 579-588 (1985) |
| 27 | | Michel Latteux,
Jeannine Leguy:
On the Usefulness of Bifaithful Rational Cones.
Mathematical Systems Theory 18(1): 19-32 (1985) |
| 1984 |
|---|
| 26 | | Michel Latteux,
Gabriel Thierrin:
On Bounded Context-free Languages.
Elektronische Informationsverarbeitung und Kybernetik 20(1): 3-8 (1984) |
| 25 | | Michel Latteux,
Grzegorz Rozenberg:
Commutative One-Counter Languages are Regular.
J. Comput. Syst. Sci. 29(1): 54-57 (1984) |
| 24 | | Mireille Clerbout,
Michel Latteux:
Partial Commutations and Faithful Rational Transductions.
Theor. Comput. Sci. 34: 241-254 (1984) |
| 1983 |
|---|
| 23 | | Michel Latteux,
Jeannine Leguy:
On the Composition of Morphisms and Inverse Morphisms.
ICALP 1983: 420-432 |
| 22 | | Michel Latteux:
On a Language Without Star.
Inf. Process. Lett. 16(1): 27-30 (1983) |
| 21 | | Michel Latteux:
Langages à un Compteur.
J. Comput. Syst. Sci. 26(1): 14-33 (1983) |
| 1982 |
|---|
| 20 | | Joffroy Beauquier,
Michel Latteux:
Substitution of Bounded Rational Cone
FOCS 1982: 236-243 |
| 19 | | Jean-Michel Autebert,
Joffroy Beauquier,
Luc Boasson,
Michel Latteux:
Indécidabilité de la Condition IRS.
ITA 16(2): 129-138 (1982) |
| 1981 |
|---|
| 18 | | Meera Blattner,
Michel Latteux:
Parikh-Bounded Languages.
ICALP 1981: 316-323 |
| 17 | | Michel Latteux:
Quelques propriétés des langages à un Comptuer.
Theoretical Computer Science 1981: 52-63 |
| 16 | | Mireille Clerbout,
Michel Latteux:
The Inclusion of D0L in MULTI-RESET.
Inf. Process. Lett. 13(2): 45-47 (1981) |
| 15 | | Jean-Michel Autebert,
Joffroy Beauquier,
Luc Boasson,
Michel Latteux:
Languages albébriques dominés par des langages unaires
Information and Control 48(1): 49-53 (1981) |
| 14 | | Michel Latteux:
A Propos du Lemme de Substitution.
Theor. Comput. Sci. 14: 119-123 (1981) |
| 1980 |
|---|
| 13 | | Michel Latteux:
Sur les générateurs algébriques et linéaires.
Acta Inf. 13: 347-363 (1980) |
| 12 | | Michel Latteux:
Transduction rationnelle, substitution et complémentaire
Information and Control 45(3): 285-299 (1980) |
| 1979 |
|---|
| 11 | | Michel Latteux,
Jeannine Leguy:
Une propriete de la famille GRE.
FCT 1979: 255-261 |
| 10 | | Michel Latteux:
Sur deux langages linéaires.
Theoretical Computer Science 1979: 182-189 |
| 9 | | Michel Latteux:
Intersections de langages algébriques bornés.
Acta Inf. 11: 233-240 (1979) |
| 8 | | Michel Latteux:
Substitutions dans le EDTOL Systèmes Ultralinéaires
Information and Control 42(2): 194-260 (1979) |
| 7 | | Michel Latteux:
Cônes rationnels commutatifs.
J. Comput. Syst. Sci. 18(3): 307-333 (1979) |
| 6 | | André Arnold,
Michel Latteux:
A New Proof of two Theorems about Rational Transductions.
Theor. Comput. Sci. 8: 261-263 (1979) |
| 1978 |
|---|
| 5 | | Michel Latteux:
Mots infinis et langages commutatifs.
ITA 12(3): (1978) |
| 4 | | Michel Latteux:
Une Note sur la Propriété de Prefixe.
Mathematical Systems Theory 11: 235-238 (1978) |
| 1977 |
|---|
| 3 | | Michel Latteux:
Cônes Rationnels Commutativement Clos.
ITA 11(1): 29-51 (1977) |
| 2 | | Michel Latteux:
Produit dans le Cône Rationnel Engendré par D.
Theor. Comput. Sci. 5(2): 129-134 (1977) |
| 1975 |
|---|
| 1 | | Michel Latteux:
Sur les TOL - Systemes Unaires.
ITA 9(3): 51-62 (1975) |
