Combinatorical and Algebraic Structures Seminar

Session details

Date: 28.2.2012
Speaker: Martin Delacourt, LIF, Université de la Méditerranée
Title: Fast arithmetical algorithms in modular moebius number systems
Abstract: We show that the computation of any Moebius transformation in a modular Moebius number systems can be performed by a finite transducer so it has time complexity which is linear in the length of the input word.

Return to index.