RUS  ENG
Full version
JOURNALS // Program Systems: Theory and Applications // Archive

Program Systems: Theory and Applications, 2016 Volume 7, Issue 4, Pages 359–367 (Mi ps230)

Mathematical Foundations of Programming

Direct-flow adder program simulation

M. M. Khatkevich

Ailamazyan Program Systems Institute of RAS

Abstract: Finite automata can add numbers represented in redundant number systems. This article gives direct-flow calculation scheme for addition. The same scheme goes for different types of input data, addition in binary, ternary, octal redundant systems is considered. Also, this scheme works adding binary matrices and real numbers. (In Russian).

Key words and phrases: adder, direct-flow calculation, number representation.

UDC: 004.67+004.222+004.222.2

Received: 27.11.2016
Accepted: 28.12.2016



© Steklov Math. Inst. of RAS, 2025