Negative bases and automata

Details Negative bases and automata Negative bases and automata

2010-12-16

arxiv.org/abs/1012.3721v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

We study expansions in non-integer negative base -{\beta} introduced by Ito and Sadahiro. Using countable automata associated with (-{\beta})-expansions, we characterize the case where the (-{\beta})-shift is a system of finite type. We prove that, if {\beta} is a Pisot number, then the (-{\beta})-shift is a sofic system. In that case, addition (and more generally normalization on any alphabet) is realizable by a finite transducer. We then give an on-line algorithm for the conversion from positive base {\beta} to negative base -{\beta}. When {\beta} is a Pisot number, the conversion can be realized by a finite on-line transducer.

Affiliated with

Also associated with

No associations

Rating

Negative bases and automata 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 Negative bases and automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Negative bases and automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220247