Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers

Details Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers

2011-01-07

arxiv.org/abs/1101.1490v1

Theor. Comput. Sci. 412 (2011), 6252-6260

Mathematics

Combinatorics

12 pages

Scientific paper

10.1016/j.tcs.2011.08.016

We derive an explicit formula for the Abelian complexity of infinite words
associated with quadratic Parry numbers.

Affiliated with

Also associated with

No associations

Rating

Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers 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 Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484351