Search results for "Gwénaël Richomme"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Gwénaël Richomme, Patrice Séébold	On factorially balanced sets of words.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	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.	2011	DBLP DOI BibTeX RDF
1	Richard Groult, Élise Prieur, Gwénaël Richomme	Counting distinct palindromes in a word in linear time.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Richard Groult, Gwénaël Richomme	Optimality of some algorithms to detect quasiperiodicities.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni	Standard factors of Sturmian words.	RAIRO - Theor. Inf. and Applic.	2010	DBLP DOI BibTeX RDF
1	Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni	Avoiding Abelian powers in binary words with bounded Abelian complexity	CoRR	2010	DBLP BibTeX RDF
1	Amy Glen, Florence Levé, Gwénaël Richomme	Directive words of episturmian words: equivalences and normalization.	ITA	2009	DBLP DOI BibTeX RDF
1	Amy Glen, Florence Levé, Gwénaël Richomme	Quasiperiodic and Lyndon episturmian words.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Amy Glen, Florence Levé, Gwénaël Richomme	Directive words of episturmian words: equivalences and normalization	CoRR	2008	DBLP BibTeX RDF
1	Amy Glen, Florence Levé, Gwénaël Richomme	Quasiperiodic and Lyndon episturmian words	CoRR	2008	DBLP BibTeX RDF
1	Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio	Well quasi-orders generated by a word-shuffle rewriting.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Florence Levé, Gwénaël Richomme	Quasiperiodic Sturmian words and morphisms.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	On Morphisms Preserving Infinite Lyndon Words.	Discrete Mathematics & Theoretical Computer Science	2007	DBLP BibTeX RDF
1	Gwénaël Richomme	Sudo-Lyndon	CoRR	2007	DBLP BibTeX RDF
1	Gwénaël Richomme	A local balance property of episturmian words	CoRR	2007	DBLP BibTeX RDF
1	Gwénaël Richomme	Sudo-Lyndon.	Bulletin of the EATCS	2007	DBLP BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	Existence of finite test-sets for k-power-freeness of uniform morphisms.	Discrete Applied Mathematics	2007	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	A Local Balance Property of Episturmian Words.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF	Arnoux-Rauzy sequences, episturmian words, balance property
1	Gwénaël Richomme	Foreword.	ITA	2006	DBLP DOI BibTeX RDF
1	Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio	Well quasi-orders and the shuffle closure of finite sets	CoRR	2006	DBLP BibTeX RDF
1	Florence Levé, Gwénaël Richomme	Quasiperiodic Sturmian words and morphisms	CoRR	2006	DBLP BibTeX RDF
1	Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio	Well Quasi Orders and the Shuffle Closure of Finite Sets.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
1	Florence Levé, Gwénaël Richomme	On a conjecture about finite fixed points of morphisms.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	Existence of finite test-sets for k-power-freeness of uniform morphisms	CoRR	2005	DBLP BibTeX RDF
1	S. Fossé, Gwénaël Richomme	Some characterizations of Parikh matrix equivalent binary words.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Patrice Séébold	Conjectures And Results On Morphisms Generating K-Power-Free Words.	Int. J. Found. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	Florence Levé, Gwénaël Richomme	Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory).	Bulletin of the EATCS	2004	DBLP BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	Overlap-free morphisms and finite test-sets.	Discrete Applied Mathematics	2004	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	Some non finitely generated monoids of repetition-free endomorphisms.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	Conjugacy and episturmian morphisms.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	Some algorithms to compute the conjugates of Episturmian morphisms.	ITA	2003	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	Some results on k-power-free morphisms.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	Finite Test-Sets for Overlap-Free Morphisms.	MFCS	2002	DBLP DOI BibTeX RDF	overlap-free words, test-sets, Combinatorics on words, morphisms
1	Daniel Kirsten, Gwénaël Richomme	Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids.	Theory Comput. Syst.	2001	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	About Cube-Free Morphisms.	STACS	2000	DBLP DOI BibTeX RDF
1	Gwénaël Richomme	Another Characterization of Sturmian Words.	Bulletin of the EATCS	1999	DBLP BibTeX RDF
1	Gwénaël Richomme, Patrice Séébold	Characterization of Test-sets for Overlap-free Morphisms.	Discrete Applied Mathematics	1999	DBLP DOI BibTeX RDF
1	Yves Métivier, Gwénaël Richomme	New Results on the Star Problem in Trace Monoids	Inf. Comput.	1995	DBLP DOI BibTeX RDF
1	Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier	Computing the Closure of Sets of Words Under Partial Commutations.	ICALP	1995	DBLP DOI BibTeX RDF	Star Problem, trace monoids, rank, commutation, recognizability
1	Gwénaël Richomme	Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable.	MFCS	1994	DBLP DOI BibTeX RDF	trace monoids, Star Problem, Finite Power Property Problem, recognizability
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	DBLP DOI BibTeX RDF	trace monoids, finite power property, recognizability

Publications of "Gwénaël Richomme" ( http://dblp.L3S.de/Authors/Gwénaël_Richomme )