Gwénaël Richomme

73 papers A* 1A 3B 3C 4Journal 60Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words. Theor. Comput. Sci. Gwénaël Richomme
2025	J	`jnl`	On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words. CoRR Gwénaël Richomme
2023	A	`conf`	Reconstructing Words Using Queries on Subwords or Factors. STACS Gwénaël Richomme, Matthieu Rosenfeld
2023	J	`jnl`	Reconstructing words using queries on subwords or factors. CoRR Gwénaël Richomme, Matthieu Rosenfeld
2021	—	`conf`	A Characterization of Binary Morphisms Generating Lyndon Infinite Words. WORDS Gwénaël Richomme, Patrice Séébold
2021	J	`jnl`	A characterization of binary morphisms generating Lyndon infinite words. CoRR Gwénaël Richomme, Patrice Séébold
2021	J	`jnl`	On sets of indefinitely desubstitutable words. Theor. Comput. Sci. Gwénaël Richomme
2020	J	`jnl`	On sets of indefinitely desubstitutable words. CoRR Gwénaël Richomme
2019	J	`jnl`	Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property. Int. J. Found. Comput. Sci. Gwénaël Richomme
2019	J	`jnl`	Coverability and multi-scale coverability on infinite pictures. J. Comput. Syst. Sci. Guilhem Gamard, Gwénaël Richomme
2018	J	`jnl`	Avoidability of circular formulas. Theor. Comput. Sci. Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
2018	J	`jnl`	Characterization of infinite LSP words and endomorphisms preserving the LSP property. CoRR Gwénaël Richomme
2018	J	`jnl`	Greedy Palindromic Lengths. Int. J. Found. Comput. Sci. Michelangelo Bucci, Gwénaël Richomme
2017	C	`conf`	A Characterization of Infinite LSP Words. DLT Gwénaël Richomme
2017	J	`jnl`	A Characterization of Infinite LSP Words. CoRR Gwénaël Richomme
2017	J	`jnl`	Periodicity in rectangular arrays. Inf. Process. Lett. Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith
2016	J	`jnl`	Avoidability of circular formulas. CoRR Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
2016	B	`conf`	Determining Sets of Quasiperiods of Infinite Words. MFCS Guilhem Gamard, Gwénaël Richomme
2016	J	`jnl`	Greedy palindromic lengths. CoRR Michelangelo Bucci, Gwénaël Richomme
2015	J	`jnl`	Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. CoRR Guilhem Gamard, Gwénaël Richomme
2015	C	`conf`	Coverability in Two Dimensions. LATA Guilhem Gamard, Gwénaël Richomme
2014	J	`jnl`	Minimal critical exponent of quasiperiodic words. Theor. Comput. Sci. Gwénaël Richomme
2013	J	`jnl`	A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers Julien Leroy, Gwénaël Richomme
2013	J	`jnl`	On Quasiperiodic Morphisms CoRR Florence Levé, Gwénaël Richomme
2013	—	`conf`	On Quasiperiodic Morphisms. WORDS Florence Levé, Gwénaël Richomme
2012	J	`jnl`	Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. Theor. Comput. Sci. Gwénaël Richomme, Patrice Séébold
2012	J	`jnl`	Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. Fabien Durand, Gwénaël Richomme
2012	J	`jnl`	Towards a statement of the S-adic conjecture through examples CoRR Fabien Durand, Julien Leroy, Gwénaël Richomme
2011	J	`jnl`	Abelian complexity of minimal subshifts. J. Lond. Math. Soc. Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2011	J	`jnl`	Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2011	J	`jnl`	On factorially balanced sets of words. Theor. Comput. Sci. Gwénaël Richomme, Patrice Séébold
2011	J	`jnl`	On the fixed points of the iterated pseudopalindromic closure operator. Theor. Comput. Sci. Damien Jamet, Geneviève Paquin, Gwénaël Richomme, Laurent Vuillon
2010	J	`jnl`	Avoiding Abelian powers in binary words with bounded Abelian complexity CoRR Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2010	J	`jnl`	Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2010	J	`jnl`	Counting distinct palindromes in a word in linear time. Inf. Process. Lett. Richard Groult, Élise Prieur, Gwénaël Richomme
2010	J	`jnl`	Optimality of some algorithms to detect quasiperiodicities. Theor. Comput. Sci. Richard Groult, Gwénaël Richomme
2010	J	`jnl`	Standard factors of Sturmian words. RAIRO Theor. Informatics Appl. Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2009	J	`jnl`	Directive words of episturmian words: equivalences and normalization. RAIRO Theor. Informatics Appl. Amy Glen, Florence Levé, Gwénaël Richomme
2008	J	`jnl`	Directive words of episturmian words: equivalences and normalization CoRR Amy Glen, Florence Levé, Gwénaël Richomme
2008	J	`jnl`	Quasiperiodic and Lyndon episturmian words CoRR Amy Glen, Florence Levé, Gwénaël Richomme
2008	J	`jnl`	Quasiperiodic and Lyndon episturmian words. Theor. Comput. Sci. Amy Glen, Florence Levé, Gwénaël Richomme
2007	C	`conf`	A Local Balance Property of Episturmian Words. Developments in Language Theory Gwénaël Richomme
2007	J	`jnl`	A local balance property of episturmian words CoRR Gwénaël Richomme
2007	J	`jnl`	Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theor. Comput. Sci. Gwénaël Richomme
2007	J	`jnl`	Existence of finite test-sets for k-power-freeness of uniform morphisms. Discret. Appl. Math. Gwénaël Richomme, Francis Wlazinski
2007	J	`jnl`	On Morphisms Preserving Infinite Lyndon Words. Discret. Math. Theor. Comput. Sci. Gwénaël Richomme
2007	J	`jnl`	Quasiperiodic Sturmian words and morphisms. Theor. Comput. Sci. Florence Levé, Gwénaël Richomme
2007	J	`jnl`	Sudo-Lyndon CoRR Gwénaël Richomme
2007	J	`jnl`	Sudo-Lyndon. Bull. EATCS Gwénaël Richomme
2007	J	`jnl`	Well quasi-orders generated by a word-shuffle rewriting. Theor. Comput. Sci. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006	J	`jnl`	Foreword. RAIRO Theor. Informatics Appl. Gwénaël Richomme
2006	J	`jnl`	Quasiperiodic Sturmian words and morphisms CoRR Florence Levé, Gwénaël Richomme
2006	C	`conf`	Well Quasi Orders and the Shuffle Closure of Finite Sets. Developments in Language Theory Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006	J	`jnl`	Well quasi-orders and the shuffle closure of finite sets CoRR Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2005	J	`jnl`	Existence of finite test-sets for k-power-freeness of uniform morphisms CoRR Gwénaël Richomme, Francis Wlazinski
2005	J	`jnl`	On a conjecture about finite fixed points of morphisms. Theor. Comput. Sci. Florence Levé, Gwénaël Richomme
2004	J	`jnl`	Conjectures And Results On Morphisms Generating K-Power-Free Words. Int. J. Found. Comput. Sci. Gwénaël Richomme, Patrice Séébold
2004	J	`jnl`	Overlap-free morphisms and finite test-sets. Discret. Appl. Math. Gwénaël Richomme, Francis Wlazinski
2004	J	`jnl`	Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory). Bull. EATCS Florence Levé, Gwénaël Richomme
2004	J	`jnl`	Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Lett. S. Fossé, Gwénaël Richomme
2003	J	`jnl`	Conjugacy and episturmian morphisms. Theor. Comput. Sci. Gwénaël Richomme
2003	J	`jnl`	Some algorithms to compute the conjugates of Episturmian morphisms. RAIRO Theor. Informatics Appl. Gwénaël Richomme
2003	J	`jnl`	Some non finitely generated monoids of repetition-free endomorphisms. Inf. Process. Lett. Gwénaël Richomme
2002	B	`conf`	Finite Test-Sets for Overlap-Free Morphisms. MFCS Gwénaël Richomme, Francis Wlazinski
2002	J	`jnl`	Some results on k-power-free morphisms. Theor. Comput. Sci. Gwénaël Richomme, Francis Wlazinski
2001	J	`jnl`	Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. Theory Comput. Syst. Daniel Kirsten, Gwénaël Richomme
2000	A	`conf`	About Cube-Free Morphisms. STACS Gwénaël Richomme, Francis Wlazinski
1999	J	`jnl`	Another Characterization of Sturmian Words. Bull. EATCS Gwénaël Richomme
1999	J	`jnl`	Characterization of Test-sets for Overlap-free Morphisms. Discret. Appl. Math. Gwénaël Richomme, Patrice Séébold
1995	A*	`conf`	Computing the Closure of Sets of Words Under Partial Commutations. ICALP Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier
1995	J	`jnl`	New Results on the Star Problem in Trace Monoids Inf. Comput. Yves Métivier, Gwénaël Richomme
1994	A	`conf`	On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). STACS Yves Métivier, Gwénaël Richomme
1994	B	`conf`	Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. MFCS Gwénaël Richomme