default search action
Patrice Séébold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c12]Gwénaël Richomme
, Patrice Séébold:
A Characterization of Binary Morphisms Generating Lyndon Infinite Words. WORDS 2021: 160-171 - [i2]Gwénaël Richomme, Patrice Séébold:
A characterization of binary morphisms generating Lyndon infinite words. CoRR abs/2105.01327 (2021)
2010 – 2019
- 2018
- [j24]Patrice Séébold:
Sturmian images of non Sturmian words and standard morphisms. Theor. Comput. Sci. 711: 92-104 (2018) - [j23]Guilhem Gamard, Pascal Ochem
Avoidability of circular formulas. Theor. Comput. Sci. 726: 1-4 (2018) - 2016
- [i1]Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. CoRR abs/1610.04439 (2016) - 2012
- [j22]Patrice Séébold:
Length-k-overlap-free Binary Infinite Words. Fundam. Informaticae 116(1-4): 251-263 (2012) - [j21]Gwénaël Richomme, Patrice Séébold:
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. Theor. Comput. Sci. 428: 92-97 (2012) - 2011
- [j20]Gwénaël Richomme, Patrice Séébold:
On factorially balanced sets of words. Theor. Comput. Sci. 412(39): 5492-5497 (2011)
2000 – 2009
- 2009
- [j19]Vesa Halava, Tero Harju
Overlap-freeness in infinite partial words. Theor. Comput. Sci. 410(8-10): 943-948 (2009) - 2008
- [j18]Patrice Séébold:
Look and Say Fibonacci. RAIRO Theor. Informatics Appl. 42(4): 729-746 (2008) - [c11]Sergey Kitaev
Counting Ordered Patterns in Words Generated by Morphisms. LATA 2008: 287-298 - 2007
- [j17]Patrice Séébold:
Tag-systems for the Hilbert Curve. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - 2004
- [j16]Gwénaël Richomme, Patrice Séébold:
Conjectures And Results On Morphisms Generating K-Power-Free Words. Int. J. Found. Comput. Sci. 15(2): 307-316 (2004) - [j15]Sergey Kitaev, Toufik Mansour
Generating the Peano Curve and Counting Occurrences of some Patterns. J. Autom. Lang. Comb. 9(4): 439-455 (2004) - 2003
- [j14]Patrice Séébold:
Foreword. Theor. Comput. Sci. 292(1): 1 (2003) - [j13]Patrice Séébold:
On some generalizations of the Thue-Morse morphism. Theor. Comput. Sci. 292(1): 283-298 (2003) - [j12]Patrice Séébold:
Lyndon factorization of the Prouhet words. Theor. Comput. Sci. 307(1): 179-197 (2003) - 2002
- [j11]Patrice Séébold:
About some Overlap-Free Morphisms on a n-Letter Alphabet. J. Autom. Lang. Comb. 7(4): 579-597 (2002) - 2001
- [c10]Patrice Séébold:
Some Properties of the Prouhet Morphism and Words. DCFS 2001: 177-186
1990 – 1999
- 1999
- [j10]Gwénaël Richomme, Patrice Séébold:
Characterization of Test-sets for Overlap-free Morphisms. Discret. Appl. Math. 98(1-2): 151-157 (1999) - 1998
- [j9]Patrice Séébold:
On the Conjugation of Standard Morphisms. Theor. Comput. Sci. 195(1): 91-109 (1998) - 1997
- [c9]Yuji Kobayashi, Friedrich Otto, Patrice Séébold:
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. COCOON 1997: 393-402 - 1996
- [c8]Patrice Séébold:
On the Conjugation of Standard Morphisms. MFCS 1996: 506-516 - 1994
- [j8]Jean Berstel, Patrice Séébold:
A Remark on Morphic Sturmian Words. RAIRO Theor. Informatics Appl. 28(3-4): 255-263 (1994) - [p1]Patrice Séébold, Karine Slowinski:
Redundant Retreat Free Words. Mathematical Aspects of Natural and Formal Languages 1994: 419-430 - 1993
- [j7]Jean Berstel, Patrice Séébold:
A Characterization of Overlap-Free Morphisms. Discret. Appl. Math. 46(3): 275-281 (1993) - [c7]Filippo Mignosi, Patrice Séébold:
If a D0L Language is k-Power Free then it is Circular. ICALP 1993: 507-518 - [c6]Jean Berstel, Patrice Séébold:
A Characterization of Sturmian Morphisms. MFCS 1993: 281-290 - 1992
- [j6]Julien Cassaigne, Sylviane R. Schwer, Patrice Séébold:
About Gauss codes. Bull. EATCS 48: 165-171 (1992) - 1991
- [j5]Patrice Séébold, Karine Slowinski:
The Shortest Way to Draw a Connected Picture. Comput. Graph. Forum 10(4): 319-327 (1991) - [j4]Patrice Séébold:
Fibonacci Morphisms and Sturmian Words. Theor. Comput. Sci. 88(2): 365-384 (1991) - 1990
- [c5]Patrice Séébold, Karine Slowinski:
Minimizing Picture Words. IMYCS 1990: 234-243
1980 – 1989
- 1989
- [c4]Patrice Séébold:
About a Family of Binary Morphisms which Stationary Words are Sturmian. FCT 1989: 384-394 - 1988
- [j3]Patrice Séébold:
An effect solution to the DOL periodicity problem in the binary case. Bull. EATCS 36: 137-151 (1988) - 1986
- [j2]Patrice Séébold:
Complément A L'étude des Suites de Thue-Morse Généralisées. RAIRO Theor. Informatics Appl. 20(2): 157-181 (1986) - 1985
- [j1]Patrice Séébold:
Sequences generated by infinitely iterated morphisms. Discret. Appl. Math. 11(3): 255-264 (1985) - [c3]Patrice Séébold:
Generalized Thue-Morse sequences. FCT 1985: 402-411 - 1984
- [c2]Patrice Séébold:
Overlap-free sequences. Automata on Infinite Words 1984: 207-215 - 1983
- [c1]Patrice Séébold:
Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits. Theoretical Computer Science 1983: 301-311
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-04-24 22:58 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: