Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-06-09
Computer Science
Formal Languages and Automata Theory
Scientific paper
We show that the problem of whether the fixed point of a morphism avoids
Abelian $k$-powers is decidable under rather general conditions
Currie James D.
Rampersad Narad
No associations
LandOfFree
Fixed points avoiding Abelian $k$-powers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixed points avoiding Abelian $k$-powers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed points avoiding Abelian $k$-powers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-580643