Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10334743 | Theoretical Computer Science | 2005 | 26 Pages |
Abstract
A conjecture of M. Billaud is: given a word w, if, for each letter x occurring in w, the word obtained by erasing all the occurrences of x in w is a fixed point of a nontrivial morphism fx, then w is also a fixed point of a non-trivial morphism. We prove that this conjecture is equivalent to a similar one on sets of words. Using this equivalence, we solve these conjectures in the particular case where each morphism fx has only one expansive letter.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
F. Levé, G. Richomme,