The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michel Latteux: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.005secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002