Finite state transducers for modular Mobius number systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11620%2F12%3A10126585" target="_blank" >RIV/00216208:11620/12:10126585 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-32589-2_30" target="_blank" >http://dx.doi.org/10.1007/978-3-642-32589-2_30</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-32589-2" target="_blank" >10.1007/978-3-642-32589-2</a>
Alternative languages
Result language
angličtina
Original language name
Finite state transducers for modular Mobius number systems
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mathematical Foundations of Computer Science 2012
ISBN
978-3-642-32588-5
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
323-334
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Bratislava
Event date
Aug 27, 2012
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—