On-line algorithms for multiplication and division in real and complex numeration systems
A positional numeration system is given by a base and by a set of digits. The base is a real or complex number $\beta$ such that $|\beta|>1$, and the digit set $A$ is a finite set of digits including $0$. Thus a number can be seen as a finite or infinite string of digits. An on-line algorithm pro...
Main Authors: | Christiane Frougny, Marta Pavelka, Edita Pelantova, Milena Svobodova |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2019-06-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/4313/pdf |
Similar Items
-
Infinite special branches in words associated with beta-expansions
by: Christiane Frougny, et al.
Published: (2007-01-01) -
From positional representation of numbers to positional representation of vectors
by: Izabella Ingrid Farkas, et al.
Published: (2023-07-01) -
FACTOR AND PALINDROMIC COMPLEXITY OF THUE-MORSE’S AVATARS
by: Christiane Frougny, et al.
Published: (2013-12-01) -
Compression algorithms for real programmers /
by: 177212 Wayner, Peter
Published: (2000) -
An algorithm to compute a rule for division problems with multiple references
by: Sánchez Sánchez, Francisca J.
Published: (2012-01-01)