Each regular code is included in a regular maximal one, Theor. Inform. Appl, vol.20, pp.89-96, 1985. ,
On codes having no finite completion, Discr. Math, vol.17, pp.309-316, 1977. ,
On ?-episturmian words, Eur. J. of Comb, vol.30, pp.473-479, 2009. ,
Factors of words under an involution, J. of Math. and Inf, vol.1, pp.52-59, 2013. ,
Pseudopalindrome closure operators in free monoids, Theoret. Comp. Sci, vol.362, pp.282-300, 2006. ,
An extension of the Lyndon-Schützenberger result to pseudoperiodic words, Inf. Comput, vol.209, pp.717-730, 2011. ,
Generalised Lyndon-Schützenberger equations, Acts of Mathematical Foundations of Computer Science 2014 (MFCS 2014), vol.8634, pp.402-413, 2014. ,
Fine and Wilf' theorem and pseudo-repetitions, Acts of Mathematical Foundations of Computer Science 2012 (MFCS 2012), vol.7464, pp.668-680, 2012. ,
Finding Pseudo-repetitions, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013, vol.20, pp.257-268, 2013. ,
, Codes and Automata, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00620616
Completing circular codes in regular submonoids, Theoret. Comp. Sci, vol.391, pp.90-98, 2008. ,
Dna codes and their properties, 12th International Meeting on DNA Computing (DNA12), vol.4287, pp.127-142, 2006. ,
Watson-crick conjugate and commutative words, 13th International Meeting on DNA Computing (DNA13), vol.4848, pp.273-283, 2008. ,
, Combinatorics on Words, 1983.
URL : https://hal.archives-ouvertes.fr/hal-00620607
On maximal codes with bounded synchronization delay, Theoret. Comp. Sci, vol.204, pp.11-28, 1998. ,