Finite state transducers for modular möbius number systems

Authors:
Martin Delacourt;Petr Kůrka
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille, Marseille Cedex, France;Center for Theoretical Study, Academy of Sciences and Charles University in Prague, Praha 1, Czechia
Venue:
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Year:
2012

Citing 6
Cited 0

Exact Real Computer Arithmetic with Continued Fractions

IEEE Transactions on Computers
An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic

IEEE Transactions on Computers
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Real functions incrementally computable by finite automata

Theoretical Computer Science - Mathematical foundations of programming semantics
Exact arithmetic on the Stern-Brocot tree

Journal of Discrete Algorithms
Fast Arithmetical Algorithms in Möbius Number Systems

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modular Möbius number systems consist of Möbius transformations with integer coefficients and unit determinant. We show that in any modular Möbius number system, the computation of a Möbius transformation with integer coefficients can be performed by a finite state transducer and has linear time complexity. As a byproduct we show that every modular Möbius number system has the expansion subshift of finite type.