Michel Latteux - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 75 from 75

2022

On rationally controlled one-rule insertion systemsMichel Latteux, Yves Roos. ita, 56:8, 2022. [doi]

2019

On prefixal one-rule string rewrite systemsMichel Latteux, Yves Roos. TCS, 795:240-256, 2019. [doi]

2015

A canonical automaton for one-rule length-preserving string rewrite systemsMichel Latteux, Yves Roos. iandc, 244:203-228, 2015. [doi]

2014

One-Rule Length-Preserving Rewrite Systems and Rational TransductionsMichel Latteux, Yves Roos. ita, 48(2):149-171, 2014. [doi]

2012

On One-Rule Grid Semi-Thue SystemsMichel Latteux, Yves Roos. FUIN, 116(1-4):189-204, 2012. [doi]

2009

Minimal NFA and biRFSA LanguagesMichel Latteux, Yves Roos, Alain Terlutte. ita, 43(2):221-237, 2009. [doi]

2007

Extension of the decidability of the marked PCP to instances with unique blocksVesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux. TCS, 380(3):355-362, 2007. [doi]

2006

Identification of biRFSA languagesMichel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte. TCS, 356(1-2):212-223, 2006. [doi]

2005

Mixed languagesJean Berstel, Luc Boasson, Michel Latteux. TCS, 332(1-3):179-198, 2005. [doi]

Equality sets of prefix morphisms and regular star languagesVesa Halava, Tero Harju, Michel Latteux. ipl, 94(4):151-154, 2005. [doi]

Representation of Regular Languages by Equality SetsVesa Halava, Tero Harju, Michel Latteux. eatcs, 86:224-228, 2005.

Equality sets for recursively enumerable languagesVesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux. ita, 39(4):661-675, 2005. [doi]

Commutation with codesJuhani Karhumäki, Michel Latteux, Ion Petre. TCS, 340(1):322-333, 2005. [doi]

Commutation with Ternary Sets of WordsJuhani Karhumäki, Michel Latteux, Ion Petre. mst, 38(2):161-169, 2005. [doi]

2004

Valence Languages Generated by Equality SetsMichel Latteux. jalc, 9(4):399-406, 2004.

2003

Languages Defined by Generalized Equality SetsVesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux. fct 2003: 355-363 [doi]

The Commutation with Codes and Ternary Sets of WordsJuhani Karhumäki, Michel Latteux, Ion Petre. STACS 2003: 74-84 [doi]

1999

Synchronized Shuffle and Regular LanguagesMichel Latteux, Yves Roos. BIRTHDAY 1999: 35-44

1998

The Meet Operation in the Lattice of CodesVéronique Bruyère, Denis Derencourt, Michel Latteux. TCS, 191(1-2):117-129, 1998. [doi]

Iterated Length-Preserving Rational TransductionsMichel Latteux, David Simplot, Alain Terlutte. mfcs 1998: 286-295 [doi]

1997

Context-Sensitive String Languages and Eecognizable Picture LanguagesMichel Latteux, David Simplot. iandc, 138(2):160-169, 1997.

Recognizable Picture Languages and Domino TilingMichel Latteux, David Simplot. TCS, 178(1-2):275-283, 1997. [doi]

Constructing Sequential BijectionsChristophe Prieur, Christian Choffrut, Michel Latteux. BIRTHDAY 1997: 308-321

1996

Variable-Length Maximal CodesVéronique Bruyère, Michel Latteux. icalp 1996: 24-47

On Computational Power of Weighted Finite AutomataDenis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte. FUIN, 25(3):285-293, 1996.

1995

Semi-CommutationsMireille Clerbout, Michel Latteux, Yves Roos. In Volker Diekert, Grzegorz Rozenberg, editors, The Book of Traces. pages 487-552, World Scientific, 1995. [doi]

1994

On Continuous Functions Computed by Finite AutomataDenis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte. ita, 28(3-4):387-403, 1994.

Codes and Infinite WordsJeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger. actaC, 11(4):241-256, 1994. [doi]

Representation of Rational Functions with Prefix and Suffix CodingsTero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte. TCS, 134(2):403-413, 1994.

1992

1990

Decomposition of Partial CommutationsMireille Clerbout, Michel Latteux, Yves Roos. icalp 1990: 501-511

Rational omega-TransductionsMichel Latteux, Erick Timmerman. mfcs 1990: 407-415

On Characterizations of Recursively Enumerable LanguagesMichel Latteux, Paavo Turakainen. ACTA, 28(2):178-186, 1990.

1989

Motifs Et Bases De LangagesJean-Michel Autebert, Luc Boasson, Michel Latteux. ita, 23(4):379-393, 1989.

1988

2-Asynchronous AutomataRobert Cori, Eric Sopena, Michel Latteux, Yves Roos. TCS, 61:93-102, 1988.

Rational Cones and CommutationsMichel Latteux. imycs 1989: 37-54

Bifaithful Starry TransductionsMichel Latteux, Erick Timmerman. ipl, 28(1):1-4, 1988.

1987

On Commutative Context-Free LanguagesJoffroy Beauquier, Meera Blattner, Michel Latteux. jcss, 35(3):311-320, 1987.

Semi-commutationsMireille Clerbout, Michel Latteux. iandc, 73(1):59-74, April 1987.

Sur Les Ensembles LinéairesMichel Latteux. ita, 21(1):33-40, 1987.

A New Normal Form for the Compositions of Morphisms and Inverse MorphismsMichel Latteux, Paavo Turakainen. mst, 20(4):261-271, 1987.

1986

Finitely Generated (Omega)o-LanguagesMichel Latteux, Erick Timmerman. ipl, 23(4):171-175, 1986.

Two Characterizations of Rational AdherencesMichel Latteux, Erick Timmerman. TCS, 46(3):101-106, 1986.

1985

On the Usefulness of Bifaithful Rational ConesMichel Latteux, Jeannine Leguy. mst, 18(1):19-32, 1985.

The Family of One-Counter Languages is Closed Under QuotientMichel Latteux, B. Leguy, B. Ratoandromanana. ACTA, 22(5):579-588, 1985.

1984

Partial Commutations and Faithful Rational TransductionsMireille Clerbout, Michel Latteux. TCS, 34:241-254, 1984.

Commutative One-Counter Languages are RegularMichel Latteux, Grzegorz Rozenberg. jcss, 29(1):54-57, 1984.

On Bounded Context-free LanguagesMichel Latteux, Gabriel Thierrin. eik, 20(1):3-8, 1984.

1983

On the Composition of Morphisms and Inverse MorphismsMichel Latteux, Jeannine Leguy. icalp 1983: 420-432

Langages à un CompteurMichel Latteux. jcss, 26(1):14-33, 1983.

On a Language Without StarMichel Latteux. ipl, 16(1):27-30, 1983.

1982

Indécidabilité de la Condition IRSJean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux. ita, 16(2):129-138, 1982.

Substitution of Bounded Rational ConeJoffroy Beauquier, Michel Latteux. focs 1982: 236-243

1981

Languages albébriques dominés par des langages unairesJean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux. iandc, 48(1):49-53, January 1981.

Parikh-Bounded LanguagesMeera Blattner, Michel Latteux. icalp 1981: 316-323

The Inclusion of D0L in MULTI-RESETMireille Clerbout, Michel Latteux. ipl, 13(2):45-47, 1981.

Quelques propriétés des langages à un ComptuerMichel Latteux. tcs 1981: 52-63

A Propos du Lemme de SubstitutionMichel Latteux. TCS, 14:119-123, 1981.

1980

Sur les générateurs algébriques et linéairesMichel Latteux. ACTA, 13:347-363, 1980.

Transduction rationnelle, substitution et complémentaireMichel Latteux. iandc, 45(3):285-299, June 1980.

1979

A New Proof of two Theorems about Rational TransductionsAndré Arnold, Michel Latteux. TCS, 8:261-263, 1979.

Une propriete de la famille GREMichel Latteux, Jeannine Leguy. fct 1979: 255-261

Sur deux langages linéairesMichel Latteux. tcs 1979: 182-189

Cônes rationnels commutatifsMichel Latteux. jcss, 18(3):307-333, 1979.

Intersections de langages algébriques bornésMichel Latteux. ACTA, 11:233-240, 1979.

Substitutions dans le EDTOL Systèmes UltralinéairesMichel Latteux. iandc, 42(2):194-260, August 1979.

1978

Une Note sur la Propriété de PrefixeMichel Latteux. mst, 11:235-238, 1978.

Mots infinis et langages commutatifsMichel Latteux. ita, 12(3):185-192, 1978.

1977

Cônes Rationnels Commutativement ClosMichel Latteux. ita, 11(1):29-51, 1977.

Produit dans le Cône Rationnel Engendré par ::::D::::Michel Latteux. TCS, 5(2):129-134, 1977.

Problems decidables concernant les tol-langages unairesMichel Latteux. DM, 17(2):165-172, 1977. [doi]

1975

Sur les TOL - Systemes UnairesMichel Latteux. ita, 9(3):51-62, 1975.

Sign in or sign up to see more results.

runs on WebDSL