default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGwénaël Richomme
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]Gwénaël Richomme, Matthieu Rosenfeld:
Reconstructing Words Using Queries on Subwords or Factors. STACS 2023: 52:1-52:15- [i18]Gwénaël Richomme, Matthieu Rosenfeld:
Reconstructing words using queries on subwords or factors. CoRR abs/2301.01571 (2023) - 2021
- [j40]Gwénaël Richomme
:
On sets of indefinitely desubstitutable words. Theor. Comput. Sci. 857: 97-113 (2021) - [c12]Gwénaël Richomme, Patrice Séébold:
A Characterization of Binary Morphisms Generating Lyndon Infinite Words. WORDS 2021: 160-171 - [i17]Gwénaël Richomme, Patrice Séébold:
A characterization of binary morphisms generating Lyndon infinite words. CoRR abs/2105.01327 (2021) - 2020
- [i16]Gwénaël Richomme:
On sets of indefinitely desubstitutable words. CoRR abs/2011.07838 (2020)
2010 – 2019
- 2019
- [j39]Gwénaël Richomme:
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property. Int. J. Found. Comput. Sci. 30(1): 171-196 (2019) - [j38]Guilhem Gamard, Gwénaël Richomme:
Coverability and multi-scale coverability on infinite pictures. J. Comput. Syst. Sci. 104: 258-277 (2019) - 2018
- [j37]Michelangelo Bucci, Gwénaël Richomme:
Greedy Palindromic Lengths. Int. J. Found. Comput. Sci. 29(3): 331-356 (2018) - [j36]Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. Theor. Comput. Sci. 726: 1-4 (2018) - [i15]Gwénaël Richomme:
Characterization of infinite LSP words and endomorphisms preserving the LSP property. CoRR abs/1808.02680 (2018) - 2017
- [j35]Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith:
Periodicity in rectangular arrays. Inf. Process. Lett. 118: 58-63 (2017) - [c11]Gwénaël Richomme:
A Characterization of Infinite LSP Words. DLT 2017: 320-331 - [i14]Gwénaël Richomme:
A Characterization of Infinite LSP Words. CoRR abs/1705.05786 (2017) - 2016
- [c10]Guilhem Gamard, Gwénaël Richomme:
Determining Sets of Quasiperiods of Infinite Words. MFCS 2016: 40:1-40:13 - [i13]Michelangelo Bucci, Gwénaël Richomme:
Greedy palindromic lengths. CoRR abs/1606.05660 (2016) - [i12]Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. CoRR abs/1610.04439 (2016) - 2015
- [c9]Guilhem Gamard, Gwénaël Richomme:
Coverability in Two Dimensions. LATA 2015: 402-413 - [i11]Guilhem Gamard, Gwénaël Richomme:
Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. CoRR abs/1506.08375 (2015) - 2014
- [j34]Gwénaël Richomme:
Minimal critical exponent of quasiperiodic words. Theor. Comput. Sci. 548: 117-122 (2014) - 2013
- [j33]Julien Leroy, Gwénaël Richomme:
A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers 13: A5 (2013) - [c8]Florence Levé, Gwénaël Richomme:
On Quasiperiodic Morphisms. WORDS 2013: 181-192 - [i10]Florence Levé, Gwénaël Richomme:
On Quasiperiodic Morphisms. CoRR abs/1304.6280 (2013) - 2012
- [j32]Fabien Durand, Gwénaël Richomme:
Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. 46(1): 1 (2012) - [j31]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) - [i9]Fabien Durand, Julien Leroy, Gwénaël Richomme:
Towards a statement of the S-adic conjecture through examples. CoRR abs/1208.6376 (2012) - 2011
- [j30]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. 22(4): 905-920 (2011) - [j29]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Abelian complexity of minimal subshifts. J. Lond. Math. Soc. 83(1): 79-95 (2011) - [j28]Damien Jamet, Geneviève Paquin, Gwénaël Richomme, Laurent Vuillon:
On the fixed points of the iterated pseudopalindromic closure operator. Theor. Comput. Sci. 412(27): 2974-2987 (2011) - [j27]Gwénaël Richomme, Patrice Séébold:
On factorially balanced sets of words. Theor. Comput. Sci. 412(39): 5492-5497 (2011) - 2010
- [j26]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. 45(2): 212-231 (2010) - [j25]Richard Groult, Élise Prieur, Gwénaël Richomme:
Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110(20): 908-912 (2010) - [j24]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Standard factors of Sturmian words. RAIRO Theor. Informatics Appl. 44(1): 159-174 (2010) - [j23]Richard Groult, Gwénaël Richomme:
Optimality of some algorithms to detect quasiperiodicities. Theor. Comput. Sci. 411(34-36): 3110-3122 (2010) - [i8]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian powers in binary words with bounded Abelian complexity. CoRR abs/1005.2514 (2010)
2000 – 2009
- 2009
- [j22]Amy Glen, Florence Levé, Gwénaël Richomme:
Directive words of episturmian words: equivalences and normalization. RAIRO Theor. Informatics Appl. 43(2): 299-319 (2009) - 2008
- [j21]Amy Glen, Florence Levé, Gwénaël Richomme:
Quasiperiodic and Lyndon episturmian words. Theor. Comput. Sci. 409(3): 578-600 (2008) - [i7]Amy Glen, Florence Levé, Gwénaël Richomme:
Directive words of episturmian words: equivalences and normalization. CoRR abs/0802.3888 (2008) - [i6]Amy Glen, Florence Levé, Gwénaël Richomme:
Quasiperiodic and Lyndon episturmian words. CoRR abs/0805.0730 (2008) - 2007
- [j20]Gwénaël Richomme, Francis Wlazinski:
Existence of finite test-sets for k-power-freeness of uniform morphisms. Discret. Appl. Math. 155(15): 2001-2016 (2007) - [j19]Gwénaël Richomme:
On Morphisms Preserving Infinite Lyndon Words. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [j18]Gwénaël Richomme:
Sudo-Lyndon. Bull. EATCS 92: 143-149 (2007) - [j17]Florence Levé, Gwénaël Richomme:
Quasiperiodic Sturmian words and morphisms. Theor. Comput. Sci. 372(1): 15-25 (2007) - [j16]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders generated by a word-shuffle rewriting. Theor. Comput. Sci. 377(1-3): 73-92 (2007) - [j15]Gwénaël Richomme:
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theor. Comput. Sci. 380(3): 393-400 (2007) - [c7]Gwénaël Richomme:
A Local Balance Property of Episturmian Words. Developments in Language Theory 2007: 371-381 - [i5]Gwénaël Richomme:
A local balance property of episturmian words. CoRR abs/cs/0702060 (2007) - [i4]Gwénaël Richomme:
Sudo-Lyndon. CoRR abs/cs/0702061 (2007) - 2006
- [j14]Gwénaël Richomme:
Foreword. RAIRO Theor. Informatics Appl. 40(3): 405-405 (2006) - [c6]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well Quasi Orders and the Shuffle Closure of Finite Sets. Developments in Language Theory 2006: 260-269 - [i3]Florence Levé, Gwénaël Richomme:
Quasiperiodic Sturmian words and morphisms. CoRR abs/cs/0601027 (2006) - [i2]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders and the shuffle closure of finite sets. CoRR abs/cs/0607082 (2006) - 2005
- [j13]Florence Levé, Gwénaël Richomme:
On a conjecture about finite fixed points of morphisms. Theor. Comput. Sci. 339(1): 103-128 (2005) - [i1]Gwénaël Richomme, Francis Wlazinski:
Existence of finite test-sets for k-power-freeness of uniform morphisms. CoRR abs/cs/0512051 (2005) - 2004
- [j12]Gwénaël Richomme, Francis Wlazinski:
Overlap-free morphisms and finite test-sets. Discret. Appl. Math. 143(1-3): 92-109 (2004) - [j11]Florence Levé, Gwénaël Richomme:
Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory). Bull. EATCS 84: 128-138 (2004) - [j10]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) - [j9]S. Fossé, Gwénaël Richomme:
Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Lett. 92(2): 77-82 (2004) - 2003
- [j8]Gwénaël Richomme:
Some non finitely generated monoids of repetition-free endomorphisms. Inf. Process. Lett. 85(2): 61-66 (2003) - [j7]Gwénaël Richomme:
Some algorithms to compute the conjugates of Episturmian morphisms. RAIRO Theor. Informatics Appl. 37(1): 85-104 (2003) - [j6]Gwénaël Richomme:
Conjugacy and episturmian morphisms. Theor. Comput. Sci. 302(1-3): 1-34 (2003) - 2002
- [j5]Gwénaël Richomme, Francis Wlazinski:
Some results on k-power-free morphisms. Theor. Comput. Sci. 273(1-2): 119-142 (2002) - [c5]Gwénaël Richomme, Francis Wlazinski:
Finite Test-Sets for Overlap-Free Morphisms. MFCS 2002: 605-614 - 2001
- [j4]Daniel Kirsten, Gwénaël Richomme:
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. Theory Comput. Syst. 34(3): 193-227 (2001) - 2000
- [c4]Gwénaël Richomme, Francis Wlazinski:
About Cube-Free Morphisms. STACS 2000: 99-109
1990 – 1999
- 1999
- [j3]Gwénaël Richomme, Patrice Séébold:
Characterization of Test-sets for Overlap-free Morphisms. Discret. Appl. Math. 98(1-2): 151-157 (1999) - [j2]Gwénaël Richomme:
Another Characterization of Sturmian Words. Bull. EATCS 67: 173-175 (1999) - 1995
- [j1]Yves Métivier, Gwénaël Richomme:
New Results on the Star Problem in Trace Monoids. Inf. Comput. 119(2): 240-251 (1995) - [c3]Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier:
Computing the Closure of Sets of Words Under Partial Commutations. ICALP 1995: 75-86 - 1994
- [c2]Gwénaël Richomme:
Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. MFCS 1994: 577-586 - [c1]Yves Métivier, Gwénaël Richomme:
On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). STACS 1994: 341-352
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-25 05:52 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:
