On-the-fly conversion of redundant into conventional representations
IEEE Transactions on Computers
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Deterministic synchronization of automations with bounded delay
Theoretical Computer Science
Basic digit sets for radix representation
Journal of the ACM (JACM)
Automata, Languages, and Machines
Automata, Languages, and Machines
Digit-Set Conversions: Generalizations and Applications
IEEE Transactions on Computers
Some Characterizations of Functions Computable in On-Line Arithmetic
IEEE Transactions on Computers
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Parallel and On-Line Addition in Negative Base and Some Complex Number Systems
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Minimization of Sequential Transducers
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
On-the-Fly Algorithms and Sequential Machines
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
Expected Acceptance Counts for Finite Automata with Almost Uniform Input
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the non-modular design of on-the-fly computations
ACM SIGCSE Bulletin
| Hi-index | 14.98 |
It is shown that a function is computable by an on-the-fly algorithm processing data in the most significant digit first fashion with a finite number of registers if and only if it is computable by a right subsequential finite state machine processing deterministically data in the least significant digit first fashion. Some applications to complex radix number systems are given.