Michel Latteux

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1	André Arnold	[j6]
2	Jean-Michel Autebert	[j31] [j15] [j14]
3	Danièle Beauquier	[c11]
4	Joffroy Beauquier	[j26] [j15] [c5] [j14]
5	Jean Berstel	[j44]
6	Meera Blattner	[j26] [c4]
7	Luc Boasson	[j44] [j31] [j15] [j14]
8	Véronique Bruyère	[j41] [c12]
9	Christian Choffrut	[c13]
10	Mireille Clerbout	[c9] [j28] [j18] [j13]
11	Robert Cori	[j29]
12	Denis Derencourt	[j41] [j38] [j36] [c10]
13	Jeanne Devolder	[j37]
14	Vesa Halava	[j50] [j48] [j47] [j46] [c17]
15	Tero Harju	[j50] [j48] [j47] [j46] [c17] [j35] [j34] [j33]
16	Hendrik Jan Hoogeboom	[j46] [c17]
17	Juhani Karhumäki	[j50] [j45] [j43] [c16] [j38] [j36] [c10]
18	Jetty Kleijn (H. C. M. Kleijn)	[j35] [j34] [j33]
19	B. Leguy	[j22]
20	Jeannine Leguy	[j21] [c6] [c2]
21	Aurélien Lemay	[j49]
22	Igor Litovsky	[j37]
23	Ion Petre	[j45] [j43] [c16]
24	Christophe Prieur	[c13]
25	B. Ratoandromanana	[j22]
26	Yves Roos	[j52] [j51] [j49] [c15] [c9] [j29]
27	Grzegorz Rozenberg	[j19]
28	David Simplot-Ryl (David Simplot)	[c14] [j40] [j39]
29	Karine Slowinski	[c11]
30	Eric Sopena	[j29]
31	Ludwig Staiger	[j37]
32	Alain Terlutte	[j51] [j49] [c14] [j38] [j36] [j35] [c10]
33	Gabriel Thierrin	[j20]
34	Erick Timmerman	[c8] [j30] [j24] [j23]
35	Paavo Turakainen	[j32] [j25]

Colors in the list of coauthors

Last update Sat May 18 17:06:15 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page