Gwénaël Richomme

	2009
35		Amy Glen, Florence Levé, Gwénaël Richomme: Directive words of episturmian words: equivalences and normalization. ITA 43(2): 299-319 (2009)
	2008
34		Amy Glen, Florence Levé, Gwénaël Richomme: Directive words of episturmian words: equivalences and normalization CoRR abs/0802.3888: (2008)
33		Amy Glen, Florence Levé, Gwénaël Richomme: Quasiperiodic and Lyndon episturmian words CoRR abs/0805.0730: (2008)
32		Amy Glen, Florence Levé, Gwénaël Richomme: Quasiperiodic and Lyndon episturmian words. Theor. Comput. Sci. 409(3): 578-600 (2008)
	2007
31		Gwénaël Richomme: A Local Balance Property of Episturmian Words. Developments in Language Theory 2007: 371-381
30		Gwénaël Richomme: A local balance property of episturmian words CoRR abs/cs/0702060: (2007)
29		Gwénaël Richomme: Sudo-Lyndon CoRR abs/cs/0702061: (2007)
28		Gwénaël Richomme, Francis Wlazinski: Existence of finite test-sets for k-power-freeness of uniform morphisms. Discrete Applied Mathematics 155(15): 2001-2016 (2007)
27		Gwénaël Richomme: On Morphisms Preserving Infinite Lyndon Words. Discrete Mathematics & Theoretical Computer Science 9(2): (2007)
26		Florence Levé, Gwénaël Richomme: Quasiperiodic Sturmian words and morphisms. Theor. Comput. Sci. 372(1): 15-25 (2007)
25		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)
24		Gwénaël Richomme: Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theor. Comput. Sci. 380(3): 393-400 (2007)
	2006
23		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
22		Florence Levé, Gwénaël Richomme: Quasiperiodic Sturmian words and morphisms CoRR abs/cs/0601027: (2006)
21		Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio: Well quasi-orders and the shuffle closure of finite sets CoRR abs/cs/0607082: (2006)
20		Gwénaël Richomme: Foreword. ITA 40(3): 405-405 (2006)
	2005
19		Gwénaël Richomme, Francis Wlazinski: Existence of finite test-sets for k-power-freeness of uniform morphisms CoRR abs/cs/0512051: (2005)
18		Florence Levé, Gwénaël Richomme: On a conjecture about finite fixed points of morphisms. Theor. Comput. Sci. 339(1): 103-128 (2005)
	2004
17		Florence Levé, Gwénaël Richomme: Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory). Bulletin of the EATCS 84: 128-138 (2004)
16		Gwénaël Richomme, Francis Wlazinski: Overlap-free morphisms and finite test-sets. Discrete Applied Mathematics 143(1-3): 92-109 (2004)
15		S. Fossé, Gwénaël Richomme: Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Lett. 92(2): 77-82 (2004)
14		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)
	2003
13		Gwénaël Richomme: Some algorithms to compute the conjugates of Episturmian morphisms. ITA 37(1): 85-104 (2003)
12		Gwénaël Richomme: Some non finitely generated monoids of repetition-free endomorphisms. Inf. Process. Lett. 85(2): 61-66 (2003)
11		Gwénaël Richomme: Conjugacy and episturmian morphisms. Theor. Comput. Sci. 302(1-3): 1-34 (2003)
	2002
10		Gwénaël Richomme, Francis Wlazinski: Finite Test-Sets for Overlap-Free Morphisms. MFCS 2002: 605-614
9		Gwénaël Richomme, Francis Wlazinski: Some results on k-power-free morphisms. Theor. Comput. Sci. 273(1-2): 119-142 (2002)
	2001
8		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
7		Gwénaël Richomme, Francis Wlazinski: About Cube-Free Morphisms. STACS 2000: 99-109
	1999
6		Gwénaël Richomme: Another Characterization of Sturmian Words. Bulletin of the EATCS 67: 173-175 (1999)
5		Gwénaël Richomme, Patrice Séébold: Characterization of Test-sets for Overlap-free Morphisms. Discrete Applied Mathematics 98(1-2): 151-157 (1999)
	1995
4		Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier: Computing the Closure of Sets of Words Under Partial Commutations. ICALP 1995: 75-86
3		Yves Métivier, Gwénaël Richomme: New Results on the Star Problem in Trace Monoids Inf. Comput. 119(2): 240-251 (1995)
	1994
2		Gwénaël Richomme: Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable. MFCS 1994: 577-586
1		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

1	Flavio D'Alessandro	[21] [23] [25]
2	S. Fossé	[15]
3	Amy Glen	[32] [33] [34] [35]
4	Daniel Kirsten	[8]
5	Florence Levé	[17] [18] [22] [26] [32] [33] [34] [35]
6	Yves Métivier	[1] [3] [4]
7	Patrice Séébold	[5] [14]
8	Stefano Varricchio	[21] [23] [25]
9	Pierre-André Wacrenier	[4]
10	Francis Wlazinski	[7] [9] [10] [16] [19] [28]

Colors in the list of coauthors