Determinization of Transducers over Infinite Words, Theory Comput. Syst, vol.37, issue.4, pp.483-502, 2004. ,
DOI : 10.1007/3-540-45022-X_47
Adherences of languages, Journal of Computer and System Sciences, vol.20, issue.3, pp.285-309, 1980. ,
DOI : 10.1016/0022-0000(80)90010-0
String-rewriting systems, Texts and monographs in computer science, 1993. ,
Théorie des ensembles, ´ Eléments de mathématique, 2006. ,
Research topics in the theory of codes, Asmics workshop Codes and Automata, p.14, 1991. ,
On a decision method in restricted second order arithmetics, International Congress on Logic, Methodology and Philosophy of Science, pp.1-11, 1960. ,
Langages formels, calculabilité et complexité, 2008. ,
A note on decidability questions on presentations of word semigroups, Theoretical Computer Science, vol.183, issue.1, pp.83-92, 1997. ,
DOI : 10.1016/S0304-3975(96)00311-8
ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS, International Journal of Foundations of Computer Science, vol.18, issue.04, pp.873-897, 2007. ,
DOI : 10.1142/S0129054107005030
Codes, mots infinis et bi-infinis, p.17, 1993. ,
Codes and infinite words, Acta Cybernetica, vol.11, issue.9, pp.241-256, 1994. ,
Automata, languages, and machines, 1974. ,
Variable length binary encodings, Bell System Tech, J, vol.38, pp.933-967, 1959. ,
Decidability of codes, Journal of Pure and Applied Algebra, vol.29, pp.13-35, 1999. ,
Fundamentals of semigroup theory, p.36, 1995. ,
Deciding multiset decipherability, IEEE Transactions on Information Theory, vol.41, issue.1, pp.291-297, 1995. ,
DOI : 10.1109/18.370097
On codes, ??-codes and ??-generators, Information Processing Letters, vol.60, issue.1, pp.1-5, 1996. ,
DOI : 10.1016/S0020-0190(96)00136-6
Reduced languages as ?-generators, Developments in Language Theory, pp.266-277, 2007. ,
On ??-generators and codes, ICALPInt. Coll. on Automata, Languages and Programming) Lecture Notes in Computer Sciences, vol.23, issue.1099, pp.393-402, 1996. ,
DOI : 10.1007/3-540-61440-0_145
On three-element codes, Theoretical Computer Science, vol.40, pp.3-11, 1985. ,
DOI : 10.1016/0304-3975(85)90100-8
Semigroups and combinatorial applications, Pure and applied mathematics, p.27, 1979. ,
Générateurs des langages rationnels de mots infinis, p.13, 1988. ,
Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, p.14, 2002. ,
Finitely generated ??-languages, Information Processing Letters, vol.23, issue.4, pp.171-175, 1986. ,
DOI : 10.1016/0020-0190(86)90131-6
On generators of rational ??-power languages, Theoretical Computer Science, vol.53, issue.2-3, pp.187-200, 1987. ,
DOI : 10.1016/0304-3975(87)90063-6
The finiteness of finitely presented monoids, Theoretical Computer Science, vol.204, issue.1-2 ,
DOI : 10.1016/S0304-3975(98)00038-3
Infinitary relations, CAAP '81 : Proceedings of the 6th Colloquium on Tree in Algebra and Programming, pp.46-75, 1981. ,
DOI : 10.1007/3-540-10828-9_54
Infinite words, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00620767
How to decide continuity of rational functions on infinite words, Theoretical Computer Science, vol.250, issue.1-2, pp.71-82, 2001. ,
DOI : 10.1016/S0304-3975(99)00115-2
On the termination problem for one-rule semi-Thue system, pp.302-316, 1996. ,
DOI : 10.1007/3-540-61464-8_61
A necessary sufficient condition for the unique decomposition of coded messages, IRE Internat. Conv. Rec, issue.8, pp.104-108, 1953. ,
Quelques constructions et algorithmes relatifs aux sous-mono¨?desmono¨?des d'un mono¨?demono¨?de libre, Semigroup Forum, p.27, 1975. ,
A note on connected ?-langages, Elektronische Informationsverarbeitung und Kybernetik, vol.166, issue.5, pp.245-251, 1980. ,
Automata on Infinite Objects, Handbook of Theoretical Computer Science, vol.B, issue.1, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50009-3
One-relation languages and ?-code generators, Proc. of the 13 th Mons Theoretical Computer Science Days, 2010. ,