Finite state transducers for modular Mobius number systems

Abstrakt

We show that in any modular Mobius number system, the computation of a Mobius transformation with integer coefficients can be performed by a finite state transducer and has linear time complexity.

Klíčová slova

• exact real algorithms
• expansion subshift