On rationally controlled one-rule insertion systems.

Michel Latteux

Michel Latteux Yves Roos On rationally controlled one-rule insertion systems. 8 2022 56 RAIRO Theor. Informatics Appl. https://doi.org/10.1051/ita/2022008 db/journals/ita/ita56.html#LatteuxR22

Michel Latteux Yves Roos On prefixal one-rule string rewrite systems. 240-256 2019 795 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.07.004 https://www.wikidata.org/entity/Q127592685 db/journals/tcs/tcs795.html#LatteuxR19

Michel Latteux Yves Roos A canonical automaton for one-rule length-preserving string rewrite systems. 203-228 2015 244 Inf. Comput. https://doi.org/10.1016/j.ic.2015.07.002 db/journals/iandc/iandc244.html#LatteuxR15

Michel Latteux Yves Roos One-Rule Length-Preserving Rewrite Systems and Rational Transductions. 149-171 2014 48 RAIRO Theor. Informatics Appl. 2 https://doi.org/10.1051/ita/2013044 db/journals/ita/ita48.html#LatteuxR14

Michel Latteux Yves Roos On One-Rule Grid Semi-Thue Systems. 189-204 2012 116 Fundam. Informaticae 1-4 https://doi.org/10.3233/FI-2012-678 db/journals/fuin/fuin116.html#LatteuxR12

Michel Latteux Yves Roos Alain Terlutte Minimal NFA and biRFSA Languages. 221-237 2009 43 RAIRO Theor. Informatics Appl. 2 https://doi.org/10.1051/ita:2008022 db/journals/ita/ita43.html#LatteuxRT09

Vesa Halava Tero Harju Juhani Karhumäki Michel Latteux Extension of the decidability of the marked PCP to instances with unique blocks. 355-362 2007 380 Theor. Comput. Sci. 3 https://doi.org/10.1016/j.tcs.2007.03.024 db/journals/tcs/tcs380.html#HalavaHKL07

Michel Latteux Aurélien Lemay Yves Roos Alain Terlutte Identification of biRFSA languages. 212-223 2006 356 Theor. Comput. Sci. 1-2 https://doi.org/10.1016/j.tcs.2006.01.029 db/journals/tcs/tcs356.html#LatteuxLRT06

Vesa Halava Tero Harju Michel Latteux Representation of Regular Languages by Equality Sets. 224-228 2005 86 Bull. EATCS db/journals/eatcs/eatcs86.html#HalavaHL05

Vesa Halava Tero Harju Michel Latteux Equality sets of prefix morphisms and regular star languages. 151-154 2005 94 Inf. Process. Lett. 4 https://doi.org/10.1016/j.ipl.2005.01.014 db/journals/ipl/ipl94.html#HalavaHL05

Vesa Halava Tero Harju Hendrik Jan Hoogeboom Michel Latteux Equality sets for recursively enumerable languages. 661-675 2005 39 RAIRO Theor. Informatics Appl. 4 https://doi.org/10.1051/ita:2005035 db/journals/ita/ita39.html#HalavaHHL05

Juhani Karhumäki Michel Latteux Ion Petre Commutation with Ternary Sets of Words. 161-169 2005 38 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-004-1191-1 db/journals/mst/mst38.html#KarhumakiLP05

Jean Berstel Luc Boasson Michel Latteux Mixed languages. 179-198 2005 332 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2004.08.016 db/journals/tcs/tcs332.html#BerstelBL05

Juhani Karhumäki Michel Latteux Ion Petre Commutation with codes. 322-333 2005 340 Theor. Comput. Sci. 1 https://doi.org/10.1016/j.tcs.2005.03.037 db/journals/tcs/tcs340.html#KarhumakiLP05

Vesa Halava Tero Harju Hendrik Jan Hoogeboom Michel Latteux Valence Languages Generated by Equality Sets. 399-406 2004 9 J. Autom. Lang. Comb. 4 db/journals/jalc/jalc9.html#Latteux04 https://doi.org/10.25596/jalc-2004-399

Vesa Halava Tero Harju Hendrik Jan Hoogeboom Michel Latteux Languages Defined by Generalized Equality Sets. 355-363 https://doi.org/10.1007/978-3-540-45077-1_33 2003 conf/fct/2003 FCT db/conf/fct/fct2003.html#HalavaHHL03 Juhani Karhumäki Michel Latteux Ion Petre The Commutation with Codes and Ternary Sets of Words. 74-84 2003 conf/stacs/2003 STACS https://doi.org/10.1007/3-540-36494-3_8 db/conf/stacs/stacs2003.html#KarhumakiLP03 Michel Latteux Yves Roos Synchronized Shuffle and Regular Languages. 35-44 1999 conf/birthday/1999salomaa Jewels are Forever db/conf/birthday/salomaa99.html#LatteuxR99

Véronique Bruyère Denis Derencourt Michel Latteux The Meet Operation in the Lattice of Codes. 117-129 1998 191 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs191.html#BruyereDL98 https://doi.org/10.1016/S0304-3975(96)00318-0

Michel Latteux David Simplot Alain Terlutte Iterated Length-Preserving Rational Transductions. 286-295 1998 conf/mfcs/1998 MFCS https://doi.org/10.1007/BFb0055778 db/conf/mfcs/mfcs98.html#LatteuxST98

Michel Latteux David Simplot Context-Sensitive String Languages and Eecognizable Picture Languages. 160-169 1997 138 Inf. Comput. 2 db/journals/iandc/iandc138.html#LatteuxS97 https://doi.org/10.1006/inco.1997.2659

Michel Latteux David Simplot Recognizable Picture Languages and Domino Tiling. 275-283 1997 178 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs178.html#LatteuxS97 https://doi.org/10.1016/S0304-3975(96)00283-6

Christophe Prieur 0002 Christian Choffrut Michel Latteux Constructing Sequential Bijections. 308-321 1997 conf/birthday/1997ehrenfeucht Structures in Logic and Computer Science db/conf/birthday/ehrenfeucht97.html#PrieurCL97 https://doi.org/10.1007/3-540-63246-8_19

Denis Derencourt Juhani Karhumäki Michel Latteux Alain Terlutte On Computational Power of Weighted Finite Automata. 285-293 1996 25 Fundam. Informaticae 3 db/journals/fuin/fuin25.html#DerencourtKLT96 https://doi.org/10.3233/FI-1996-253406

Véronique Bruyère Michel Latteux Variable-Length Maximal Codes. 24-47 1996 conf/icalp/1996 ICALP db/conf/icalp/icalp96.html#BruyereL96 https://doi.org/10.1007/3-540-61440-0_115 Mireille Clerbout Michel Latteux Yves Roos Semi-Commutations. 487-552 1995 The Book of Traces https://doi.org/10.1142/9789814261456_0012 books/ws/95/DR1995 db/books/collections/DR1995.html#ClerboutLR95

Jeanne Devolder Michel Latteux Igor Litovsky Ludwig Staiger Codes and Infinite Words. 241-256 1994 11 Acta Cybern. 4 https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3432 db/journals/actaC/actaC11.html#DevolderLLS94

Denis Derencourt Juhani Karhumäki Michel Latteux Alain Terlutte On Continuous Functions Computed by Finite Automata. 387-403 1994 28 RAIRO Theor. Informatics Appl. 3-4 db/journals/ita/ita28.html#DerencourtKLT94 https://doi.org/10.1051/ita/1994283-403871

Tero Harju H. C. M. Kleijn Michel Latteux Alain Terlutte Representation of Rational Functions with Prefix and Suffix Codings. 403-413 1994 134 Theor. Comput. Sci. 2 db/journals/tcs/tcs134.html#HarjuKLT94 https://doi.org/10.1016/0304-3975(94)90245-3

Tero Harju H. C. M. Kleijn Michel Latteux Deterministic Sequential Functions. 545-554 1992 29 Acta Informatica 6/7 db/journals/acta/acta29.html#HarjuKL92 https://doi.org/10.1007/BF01185560

Tero Harju H. C. M. Kleijn Michel Latteux Compositional representation of rational functions. 243-255 1992 26 RAIRO Theor. Informatics Appl. db/journals/ita/ita26.html#HarjuKL92 https://doi.org/10.1051/ita/1992260302431

Danièle Beauquier Michel Latteux Karine Slowinski A Decidability Result about Convex Polyominoes. 32-45 1992 conf/latin/1992 LATIN db/conf/latin/latin92.html#BeauquierLS92 https://doi.org/10.1007/BFb0023815 Denis Derencourt Juhani Karhumäki Michel Latteux Alain Terlutte On Computational Power of Weighted Finite Automata. 236-245 1992 conf/mfcs/1992 MFCS db/conf/mfcs/mfcs92.html#DerencourtKLT92 https://doi.org/10.1007/3-540-55808-X_22

Michel Latteux Paavo Turakainen On Characterizations of Recursively Enumerable Languages. 178-186 1990 28 Acta Informatica 2 db/journals/acta/acta28.html#LatteuxT90 https://doi.org/10.1007/BF01237236

Mireille Clerbout Michel Latteux Yves Roos Decomposition of Partial Commutations. 501-511 1990 conf/icalp/1990 ICALP db/conf/icalp/icalp90.html#ClerboutLR90 https://doi.org/10.1007/BFb0032054 Michel Latteux Erick Timmerman Rational omega-Transductions. 407-415 1990 conf/mfcs/1990 MFCS db/conf/mfcs/mfcs90.html#LatteuxT90 https://doi.org/10.1007/BFb0029636

Jean-Michel Autebert Luc Boasson Michel Latteux Motifs Et Bases De Langages. 379-393 1989 23 RAIRO Theor. Informatics Appl. 4 db/journals/ita/ita23.html#AutebertBL89 https://doi.org/10.1051/ita/1989230403791

Michel Latteux Erick Timmerman Bifaithful Starry Transductions. 1-4 1988 28 Inf. Process. Lett. 1 db/journals/ipl/ipl28.html#LatteuxT88 https://doi.org/10.1016/0020-0190(88)90135-4

Robert Cori Éric Sopena Michel Latteux Yves Roos 2-Asynchronous Automata. 93-102 1988 61 Theor. Comput. Sci. db/journals/tcs/tcs61.html#CoriSLR88 https://doi.org/10.1016/0304-3975(88)90110-7

Michel Latteux Rational Cones and Commutations. 37-54 1988 conf/imycs/1988 IMYCS db/conf/imycs/imycs1988.html#Latteux88 https://doi.org/10.1007/BFb0015926

Semi-commutations Mireille Clerbout Michel Latteux 59-74 Inf. Comput. April 1987 73 1 db/journals/iandc/iandc73.html#ClerboutL87 https://doi.org/10.1016/0890-5401(87)90040-X

Michel Latteux Sur Les Ensembles Linéaires. 33-40 1987 21 RAIRO Theor. Informatics Appl. 1 db/journals/ita/ita21.html#Latteux87 https://doi.org/10.1051/ita/1987210100331

Joffroy Beauquier Meera Blattner Michel Latteux On Commutative Context-Free Languages. 311-320 1987 35 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss35.html#BeauquierBL87 https://doi.org/10.1016/0022-0000(87)90018-3

Michel Latteux Paavo Turakainen A New Normal Form for the Compositions of Morphisms and Inverse Morphisms. 261-271 1987 20 Math. Syst. Theory 4 db/journals/mst/mst20.html#LatteuxT87 https://doi.org/10.1007/BF01692069

Michel Latteux Erick Timmerman Finitely Generated (Omega)o-Languages. 171-175 1986 23 Inf. Process. Lett. 4 db/journals/ipl/ipl23.html#LatteuxT86 https://doi.org/10.1016/0020-0190(86)90131-6

Michel Latteux Erick Timmerman Two Characterizations of Rational Adherences. 101-106 1986 46 Theor. Comput. Sci. 3 db/journals/tcs/tcs46.html#LatteuxT86 https://doi.org/10.1016/0304-3975(86)90025-3

Michel Latteux B. Leguy B. Ratoandromanana The Family of One-Counter Languages is Closed Under Quotient. 579-588 1985 22 Acta Informatica 5 db/journals/acta/acta22.html#LatteuxLR85 https://doi.org/10.1007/BF00267045

Michel Latteux Jeannine Leguy On the Usefulness of Bifaithful Rational Cones. 19-32 1985 18 Math. Syst. Theory 1 db/journals/mst/mst18.html#LatteuxL85 https://doi.org/10.1007/BF01699459

Michel Latteux Gabriel Thierrin On Bounded Context-free Languages. 3-8 1984 20 J. Inf. Process. Cybern. 1 db/journals/eik/eik20.html#LatteuxT84

Michel Latteux Grzegorz Rozenberg Commutative One-Counter Languages are Regular. 54-57 1984 29 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss29.html#LatteuxR84 https://doi.org/10.1016/0022-0000(84)90013-8

Mireille Clerbout Michel Latteux Partial Commutations and Faithful Rational Transductions. 241-254 1984 34 Theor. Comput. Sci. db/journals/tcs/tcs34.html#ClerboutL84 https://doi.org/10.1016/0304-3975(84)90053-7

Michel Latteux On a Language Without Star. 27-30 1983 16 Inf. Process. Lett. 1 db/journals/ipl/ipl16.html#Latteux83 https://doi.org/10.1016/0020-0190(83)90008-X

Michel Latteux Langages à un Compteur. 14-33 1983 26 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss26.html#Latteux83 https://doi.org/10.1016/0022-0000(83)90018-1

Michel Latteux Jeannine Leguy On the Composition of Morphisms and Inverse Morphisms. 420-432 1983 conf/icalp/1983 ICALP db/conf/icalp/icalp83.html#LatteuxL83 https://doi.org/10.1007/BFb0036926

Jean-Michel Autebert Joffroy Beauquier Luc Boasson Michel Latteux Indécidabilité de la Condition IRS. 129-138 1982 16 RAIRO Theor. Informatics Appl. 2 db/journals/ita/ita16.html#AutebertBBL82 https://doi.org/10.1051/ita/1982160201291

Substitution of Bounded Rational Cone Joffroy Beauquier Michel Latteux 236-243 conf/focs/FOCS23 1982 FOCS db/conf/focs/focs82.html#BeauquierL82 https://doi.org/10.1109/SFCS.1982.90 https://doi.ieeecomputersociety.org/10.1109/SFCS.1982.90

Languages albébriques dominés par des langages unaires Jean-Michel Autebert Joffroy Beauquier Luc Boasson Michel Latteux 49-53 Inf. Control. January 1981 48 1 db/journals/iandc/iandc48.html#AutebertBBL81 https://doi.org/10.1016/S0019-9958(81)90588-X

Mireille Clerbout Michel Latteux The Inclusion of D0L in MULTI-RESET. 45-47 1981 13 Inf. Process. Lett. 2 db/journals/ipl/ipl13.html#ClerboutL81 https://doi.org/10.1016/0020-0190(81)90028-4

Michel Latteux A Propos du Lemme de Substitution. 119-123 1981 14 Theor. Comput. Sci. db/journals/tcs/tcs14.html#Latteux81 https://doi.org/10.1016/0304-3975(81)90020-7

Meera Blattner Michel Latteux Parikh-Bounded Languages. 316-323 1981 conf/icalp/1981 ICALP db/conf/icalp/icalp81.html#BlattnerL81 https://doi.org/10.1007/3-540-10843-2_26 Michel Latteux Quelques propriétés des langages à un Comptuer. 52-63 1981 conf/tcs/1981 Theoretical Computer Science db/conf/tcs/tcs1981.html#Latteux81 https://doi.org/10.1007/BFb0017296

Michel Latteux Sur les générateurs algébriques et linéaires. 347-363 1980 13 Acta Informatica db/journals/acta/acta13.html#Latteux80 https://doi.org/10.1007/BF00288769

Transduction rationnelle, substitution et complémentaire Michel Latteux 285-299 Inf. Control. June 1980 45 3 db/journals/iandc/iandc45.html#Latteux80 https://doi.org/10.1016/S0019-9958(80)90670-1

Michel Latteux Intersections de langages algébriques bornés. 233-240 1979 11 Acta Informatica db/journals/acta/acta11.html#Latteux79 https://doi.org/10.1007/BF00289069

Substitutions dans le EDTOL Systèmes Ultralinéaires Michel Latteux 194-260 Inf. Control. August 1979 42 2 db/journals/iandc/iandc42.html#Latteux79 https://doi.org/10.1016/S0019-9958(79)90641-7

Michel Latteux Cônes rationnels commutatifs. 307-333 1979 18 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss18.html#Latteux79 https://doi.org/10.1016/0022-0000(79)90039-4

André Arnold Michel Latteux A New Proof of two Theorems about Rational Transductions. 261-263 1979 8 Theor. Comput. Sci. db/journals/tcs/tcs8.html#ArnoldL79 https://doi.org/10.1016/0304-3975(79)90049-5

Michel Latteux Jeannine Leguy Une propriete de la famille GRE. 255-261 1979 conf/fct/1979 FCT db/conf/fct/fct79.html#LatteuxL79 Michel Latteux Sur deux langages linéaires. 182-189 1979 conf/tcs/1979 Theoretical Computer Science db/conf/tcs/tcs1979.html#Latteux79 https://doi.org/10.1007/3-540-09118-1_20

Michel Latteux Mots infinis et langages commutatifs. 1978 12 RAIRO Theor. Informatics Appl. 3 db/journals/ita/ita12.html#Latteux78 https://doi.org/10.1051/ita/1978120301851 185-192

Michel Latteux Une Note sur la Propriété de Prefixe. 235-238 1978 11 Math. Syst. Theory db/journals/mst/mst11.html#Latteux78 https://doi.org/10.1007/BF01768478

Michel Latteux Problems decidables concernant les tol-langages unaires. 165-172 1977 17 Discret. Math. 2 https://doi.org/10.1016/0012-365X(77)90147-9 db/journals/dm/dm17.html#Latteux77

Michel Latteux Cônes Rationnels Commutativement Clos. 29-51 1977 11 RAIRO Theor. Informatics Appl. 1 db/journals/ita/ita11.html#Latteux77 https://doi.org/10.1051/ita/1977110100291

Michel Latteux Produit dans le Cône Rationnel Engendré par <i>D</i>. 129-134 1977 5 2 Theor. Comput. Sci. db/journals/tcs/tcs5.html#Latteux77 https://doi.org/10.1016/0304-3975(77)90003-2

Michel Latteux Sur les TOL - Systemes Unaires. 51-62 1975 9 RAIRO Theor. Informatics Appl. 3 db/journals/ita/ita9.html#Latteux75 https://doi.org/10.1051/ita/197509R300511

André Arnold Jean-Michel Autebert Danièle Beauquier Joffroy Beauquier Jean Berstel Meera Blattner Luc Boasson Véronique Bruyère Christian Choffrut Mireille Clerbout Robert Cori Denis Derencourt Jeanne Devolder Vesa Halava Tero Harju Hendrik Jan Hoogeboom Juhani Karhumäki Jetty KleijnH. C. M. Kleijn B. Leguy Jeannine Leguy Aurélien Lemay Igor Litovsky Ion Petre Christophe Prieur 0002 B. Ratoandromanana Yves Roos Grzegorz Rozenberg David Simplot-RylDavid Simplot Karine Slowinski Éric Sopena Ludwig Staiger Alain Terlutte Gabriel Thierrin Erick Timmerman Paavo Turakainen