The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gwénaël Richomme: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
    Well Quasi Orders and the Shuffle Closure of Finite Sets. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:260-269 [Conf]
  2. Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier
    Computing the Closure of Sets of Words Under Partial Commutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:75-86 [Conf]
  3. Gwénaël Richomme
    Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:577-586 [Conf]
  4. Gwénaël Richomme, Francis Wlazinski
    Finite Test-Sets for Overlap-Free Morphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:605-614 [Conf]
  5. Yves Métivier, Gwénaël Richomme
    On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:341-352 [Conf]
  6. Gwénaël Richomme, Francis Wlazinski
    About Cube-Free Morphisms. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:99-109 [Conf]
  7. Gwénaël Richomme, Patrice Séébold
    Characterization of Test-sets for Overlap-free Morphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:151-157 [Journal]
  8. Gwénaël Richomme, Francis Wlazinski
    Overlap-free morphisms and finite test-sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:92-109 [Journal]
  9. Florence Levé, Gwénaël Richomme
    Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:84, n:, pp:128-138 [Journal]
  10. Gwénaël Richomme
    Another Characterization of Sturmian Words. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:67, n:, pp:173-175 [Journal]
  11. Yves Métivier, Gwénaël Richomme
    New Results on the Star Problem in Trace Monoids [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:240-251 [Journal]
  12. Gwénaël Richomme, Patrice Séébold
    Conjectures And Results On Morphisms Generating K-Power-Free Words. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:307-316 [Journal]
  13. S. Fossé, Gwénaël Richomme
    Some characterizations of Parikh matrix equivalent binary words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:77-82 [Journal]
  14. Gwénaël Richomme
    Some non finitely generated monoids of repetition-free endomorphisms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:2, pp:61-66 [Journal]
  15. Gwénaël Richomme
    Some algorithms to compute the conjugates of Episturmian morphisms. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:1, pp:85-104 [Journal]
  16. Daniel Kirsten, Gwénaël Richomme
    Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:3, pp:193-227 [Journal]
  17. Florence Levé, Gwénaël Richomme
    On a conjecture about finite fixed points of morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:1, pp:103-128 [Journal]
  18. Gwénaël Richomme
    Conjugacy and episturmian morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:1-34 [Journal]
  19. Gwénaël Richomme, Francis Wlazinski
    Some results on k-power-free morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:119-142 [Journal]
  20. Florence Levé, Gwénaël Richomme
    Quasiperiodic Sturmian words and morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:1, pp:15-25 [Journal]
  21. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
    Well quasi-orders generated by a word-shuffle rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:73-92 [Journal]
  22. Gwénaël Richomme
    A Local Balance Property of Episturmian Words. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:371-381 [Conf]
  23. Gwénaël Richomme
    A local balance property of episturmian words [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  24. Gwénaël Richomme
    Sudo-Lyndon [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  25. Florence Levé, Gwénaël Richomme
    Quasiperiodic Sturmian words and morphisms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  26. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
    Well quasi-orders and the shuffle closure of finite sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  27. Gwénaël Richomme, Francis Wlazinski
    Existence of finite test-sets for k-power-freeness of uniform morphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:15, pp:2001-2016 [Journal]
  28. Gwénaël Richomme
    Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:393-400 [Journal]

  29. Existence of finite test-sets for k-power-freeness of uniform morphisms [Citation Graph (, )][DBLP]


  30. Directive words of episturmian words: equivalences and normalization [Citation Graph (, )][DBLP]


  31. Quasiperiodic and Lyndon episturmian words [Citation Graph (, )][DBLP]


  32. Avoiding Abelian powers in binary words with bounded Abelian complexity [Citation Graph (, )][DBLP]


  33. On Morphisms Preserving Infinite Lyndon Words. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.021secs
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