On-Line Addition in Real Base

Authors:
Christiane Frougny
Affiliations:
-
Venue:
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Year:
1999

Citing 5
Cited 0

Computability by finite automata and Pisot bases

Mathematical Systems Theory
Deterministic synchronization of automations with bounded delay

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Some Characterizations of Functions Computable in On-Line Arithmetic

IEEE Transactions on Computers
On-Line Algorithms for Division and Multiplication

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let β be a real number 1. Addition and multiplication by a fixed positive integer of real numbers represented in base β are shown to be computable by an on-line algorithm, and thus are continuous functions. When β is a Pisot number, these functions cire computable by an on-line finite automaton.