The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Patrice Séébold: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuji Kobayashi, Friedrich Otto, Patrice Séébold
    A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:393-402 [Conf]
  2. Patrice Séébold
    Generalized Thue-Morse sequences. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:402-411 [Conf]
  3. Patrice Séébold
    About a Family of Binary Morphisms which Stationary Words are Sturmian. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:384-394 [Conf]
  4. Filippo Mignosi, Patrice Séébold
    If a D0L Language is k-Power Free then it is Circular. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:507-518 [Conf]
  5. Patrice Séébold, Karine Slowinski
    Minimizing Picture Words. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:234-243 [Conf]
  6. Patrice Séébold
    Overlap-free sequences. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:207-215 [Conf]
  7. Jean Berstel, Patrice Séébold
    A Characterization of Sturmian Morphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:281-290 [Conf]
  8. Patrice Séébold
    On the Conjugation of Standard Morphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:506-516 [Conf]
  9. Patrice Séébold
    Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:301-311 [Conf]
  10. Patrice Séébold, Karine Slowinski
    The Shortest Way to Draw a Connected Picture. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1991, v:10, n:4, pp:319-327 [Journal]
  11. Jean Berstel, Patrice Séébold
    A Characterization of Overlap-Free Morphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:3, pp:275-281 [Journal]
  12. 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]
  13. Julien Cassaigne, Sylviane R. Schwer, Patrice Séébold
    About Gauss codes. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:48, n:, pp:165-171 [Journal]
  14. Patrice Séébold
    An effect solution to the DOL periodicity problem in the binary case. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:36, n:, pp:137-151 [Journal]
  15. 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]
  16. Jean Berstel, Patrice Séébold
    A Remark on Morphic Sturmian Words. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:255-263 [Journal]
  17. Patrice Séébold
    Complément A L'étude des Suites de Thue-Morse Généralisées. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:2, pp:157-181 [Journal]
  18. Patrice Séébold
    About some Overlap-Free Morphisms on a n-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:579-597 [Journal]
  19. Patrice Séébold
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:1- [Journal]
  20. Patrice Séébold
    On some generalizations of the Thue-Morse morphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:283-298 [Journal]
  21. Patrice Séébold
    Lyndon factorization of the Prouhet words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:1, pp:179-197 [Journal]
  22. Patrice Séébold
    Fibonacci Morphisms and Sturmian Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:2, pp:365-384 [Journal]
  23. Patrice Séébold
    On the Conjugation of Standard Morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:195, n:1, pp:91-109 [Journal]

  24. Counting Ordered Patterns in Words Generated by Morphisms. [Citation Graph (, )][DBLP]


  25. Tag-systems for the Hilbert Curve. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002