|
|||||||||||||||
DOI: 10.1051/ita:1999107
ITA, Vol. 33, N
1, 1999, p. 79-101
On-line finite automata for addition in some numeration systems
Christiane Frougny
Université Paris VIII and L.I.A.F.A., Case 7014, 2 place Jussieu, 75251
Paris Cedex 05, France;
(Christiane.Frougny@liafa.jussieu.fr)
Received May, 1998. Accepted November, 1998.
Abstract: We consider numeration systems where the
base is a negative integer, or a complex number which is a root of a
negative integer.
We give parallel algorithms for addition in these numeration systems,
from which we derive on-line algorithms realized by finite
automata. A general construction relating addition in base
and addition in base
is given.
Results on addition in base
, where b is a relative
integer, follow.
We also show that addition in base the golden ratio
is computable by an on-line finite automaton, but is not
parallelizable.
Communicated by: Ch. Choffrut.
Copyright EDP Sciences
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook