Matrix analysis
On Abelian squares and substitutions
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Sur les mots sans carré définis par un morphisme
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Abelian Squares are Avoidable on 4 Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
If a D0L Language is k-Power Free then it is Circular
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A cyclic binary morphism avoiding Abelian fourth powers
Theoretical Computer Science
Hi-index | 0.00 |
We show that the problem of whether the fixed point of a morphism avoids Abelian k-powers is decidable under rather general conditions, the most important being that the frequency matrix M of the morphism be invertible and that |M^-^1|