default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Latteux
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j57]Michel Latteux, Yves Roos
:
On rationally controlled one-rule insertion systems. RAIRO Theor. Informatics Appl. 56: 8 (2022)
2010 – 2019
- 2019
- [j56]Michel Latteux, Yves Roos:
On prefixal one-rule string rewrite systems. Theor. Comput. Sci. 795: 240-256 (2019) - 2015
- [j55]Michel Latteux, Yves Roos:
A canonical automaton for one-rule length-preserving string rewrite systems. Inf. Comput. 244: 203-228 (2015) - 2014
- [j54]Michel Latteux, Yves Roos:
One-Rule Length-Preserving Rewrite Systems and Rational Transductions. RAIRO Theor. Informatics Appl. 48(2): 149-171 (2014) - 2012
- [j53]Michel Latteux, Yves Roos:
On One-Rule Grid Semi-Thue Systems. Fundam. Informaticae 116(1-4): 189-204 (2012)
2000 – 2009
- 2009
- [j52]Michel Latteux, Yves Roos, Alain Terlutte:
Minimal NFA and biRFSA Languages. RAIRO Theor. Informatics Appl. 43(2): 221-237 (2009) - 2007
- [j51]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
- [j50]Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte:
Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006) - 2005
- [j49]Vesa Halava, Tero Harju, Michel Latteux:
Representation of Regular Languages by Equality Sets. Bull. EATCS 86: 224-228 (2005) - [j48]Vesa Halava, Tero Harju, Michel Latteux:
Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett. 94(4): 151-154 (2005) - [j47]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. 39(4): 661-675 (2005) - [j46]Juhani Karhumäki, Michel Latteux, Ion Petre:
Commutation with Ternary Sets of Words. Theory Comput. Syst. 38(2): 161-169 (2005) - [j45]Jean Berstel, Luc Boasson, Michel Latteux:
Mixed languages. Theor. Comput. Sci. 332(1-3): 179-198 (2005) - [j44]Juhani Karhumäki, Michel Latteux, Ion Petre:
Commutation with codes. Theor. Comput. Sci. 340(1): 322-333 (2005) - 2004
- [j43]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Valence Languages Generated by Equality Sets. J. Autom. Lang. Comb. 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
1990 – 1999
- 1999
- [c15]Michel Latteux, Yves Roos:
Synchronized Shuffle and Regular Languages. Jewels are Forever 1999: 35-44 - 1998
- [j42]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
- [j41]Michel Latteux, David Simplot:
Context-Sensitive String Languages and Eecognizable Picture Languages. Inf. Comput. 138(2): 160-169 (1997) - [j40]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
- [j39]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Computational Power of Weighted Finite Automata. Fundam. Informaticae 25(3): 285-293 (1996) - [c12]Véronique Bruyère, Michel Latteux:
Variable-Length Maximal Codes. ICALP 1996: 24-47 - 1995
- [p1]Mireille Clerbout, Michel Latteux, Yves Roos:
Semi-Commutations. The Book of Traces 1995: 487-552 - 1994
- [j38]Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger:
Codes and Infinite Words. Acta Cybern. 11(4): 241-256 (1994) - [j37]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Continuous Functions Computed by Finite Automata. RAIRO Theor. Informatics Appl. 28(3-4): 387-403 (1994) - [j36]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
- [j35]Tero Harju, H. C. M. Kleijn, Michel Latteux:
Deterministic Sequential Functions. Acta Informatica 29(6/7): 545-554 (1992) - [j34]Tero Harju, H. C. M. Kleijn, Michel Latteux:
Compositional representation of rational functions. RAIRO Theor. Informatics Appl. 26: 243-255 (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
- [j33]Michel Latteux, Paavo Turakainen:
On Characterizations of Recursively Enumerable Languages. Acta Informatica 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
1980 – 1989
- 1989
- [j32]Jean-Michel Autebert, Luc Boasson, Michel Latteux:
Motifs Et Bases De Langages. RAIRO Theor. Informatics Appl. 23(4): 379-393 (1989) - 1988
- [j31]Michel Latteux, Erick Timmerman:
Bifaithful Starry Transductions. Inf. Process. Lett. 28(1): 1-4 (1988) - [j30]Robert Cori, Éric 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
- [j29]Mireille Clerbout, Michel Latteux:
Semi-commutations. Inf. Comput. 73(1): 59-74 (1987) - [j28]Michel Latteux:
Sur Les Ensembles Linéaires. RAIRO Theor. Informatics Appl. 21(1): 33-40 (1987) - [j27]Joffroy Beauquier, Meera Blattner, Michel Latteux:
On Commutative Context-Free Languages. J. Comput. Syst. Sci. 35(3): 311-320 (1987) - [j26]Michel Latteux, Paavo Turakainen:
A New Normal Form for the Compositions of Morphisms and Inverse Morphisms. Math. Syst. Theory 20(4): 261-271 (1987) - 1986
- [j25]Michel Latteux, Erick Timmerman:
Finitely Generated (Omega)o-Languages. Inf. Process. Lett. 23(4): 171-175 (1986) - [j24]Michel Latteux, Erick Timmerman:
Two Characterizations of Rational Adherences. Theor. Comput. Sci. 46(3): 101-106 (1986) - 1985
- [j23]Michel Latteux, B. Leguy, B. Ratoandromanana:
The Family of One-Counter Languages is Closed Under Quotient. Acta Informatica 22(5): 579-588 (1985) - [j22]Michel Latteux, Jeannine Leguy:
On the Usefulness of Bifaithful Rational Cones. Math. Syst. Theory 18(1): 19-32 (1985) - 1984
- [j21]Michel Latteux, Gabriel Thierrin:
On Bounded Context-free Languages. J. Inf. Process. Cybern. 20(1): 3-8 (1984) - [j20]Michel Latteux, Grzegorz Rozenberg:
Commutative One-Counter Languages are Regular. J. Comput. Syst. Sci. 29(1): 54-57 (1984) - [j19]Mireille Clerbout, Michel Latteux:
Partial Commutations and Faithful Rational Transductions. Theor. Comput. Sci. 34: 241-254 (1984) - 1983
- [j18]Michel Latteux:
On a Language Without Star. Inf. Process. Lett. 16(1): 27-30 (1983) - [j17]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
- [j16]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux:
Indécidabilité de la Condition IRS. RAIRO Theor. Informatics Appl. 16(2): 129-138 (1982) - [c5]Joffroy Beauquier, Michel Latteux:
Substitution of Bounded Rational Cone. FOCS 1982: 236-243 - 1981
- [j15]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Michel Latteux:
Languages albébriques dominés par des langages unaires. Inf. Control. 48(1): 49-53 (1981) - [j14]Mireille Clerbout, Michel Latteux:
The Inclusion of D0L in MULTI-RESET. Inf. Process. Lett. 13(2): 45-47 (1981) - [j13]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
- [j12]Michel Latteux:
Sur les générateurs algébriques et linéaires. Acta Informatica 13: 347-363 (1980) - [j11]Michel Latteux:
Transduction rationnelle, substitution et complémentaire. Inf. Control. 45(3): 285-299 (1980)
1970 – 1979
- 1979
- [j10]Michel Latteux:
Intersections de langages algébriques bornés. Acta Informatica 11: 233-240 (1979) - [j9]Michel Latteux:
Substitutions dans le EDTOL Systèmes Ultralinéaires. Inf. Control. 42(2): 194-260 (1979) - [j8]Michel Latteux:
Cônes rationnels commutatifs. J. Comput. Syst. Sci. 18(3): 307-333 (1979) - [j7]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
- [j6]Michel Latteux:
Mots infinis et langages commutatifs. RAIRO Theor. Informatics Appl. 12(3): 185-192 (1978) - [j5]Michel Latteux:
Une Note sur la Propriété de Prefixe. Math. Syst. Theory 11: 235-238 (1978) - 1977
- [j4]Michel Latteux:
Problems decidables concernant les tol-langages unaires. Discret. Math. 17(2): 165-172 (1977) - [j3]Michel Latteux:
Cônes Rationnels Commutativement Clos. RAIRO Theor. Informatics Appl. 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. RAIRO Theor. Informatics Appl. 9(3): 51-62 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
