*Result*: Finite State Transducers for Modular Möbius Number Systems
Title:
Finite State Transducers for Modular Möbius Number Systems
Authors:
Contributors:
Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Centre for Theoretical Studies, Charles University, Czechia (CTS), Charles University Prague (CU)-Czech Academy of Sciences Prague (CAS)
Source:
Mathematical Foundations of Computer Science 201237th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings ; https://hal.archives-ouvertes.fr/hal-01957675 ; Mathematical Foundations of Computer Science 2012 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings, pp.323-334, 2012
Publisher Information:
HAL CCSD
Publication Year:
2012
Collection:
Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe)
Subject Terms:
Document Type:
*Book*
book part
Language:
English
Relation:
Availability:
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edsbas.7E791C54
Database:
BASE
*Further Information*
*International audience ; 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.*