1. Codes and Automata;Berstel,2010
2. Automata and codes with a bounded deciphering delay;Bruyère,1992
3. On θ-episturmian words;Bucci;European J. Combin.,2009
4. Sur un algorithme donnant les codes bipréfixes finis;Césari;Theory Comput. Syst.,1972
5. An extension of the Lyndon–Schützenberger result to pseudoperiodic words;Czeizler;Inform. and Comput.,2011