二进制补码计数系统的斐波那契类比
A Fibonacci analogue of the two's complement numeration system
AI总结:
本文提出斐波那契计数系统的补码表示法,证明其加法可由确定性有限状态转换器实现,并基于Berstel加法器给出构造性证明,同时刻画了该表示法与整数集之间的递增双射关系。
摘要:
利用经典的有符号整数二进制补码表示法,加法、减法和乘法等基本算术运算与无符号二进制数的运算完全相同。我们引入了一种斐波那契等价的二进制补码表示法,并证明在该计数系统中的加法可以由一个确定性的有限状态转换器来执行。该结果基于Berstel加法器,该加法器用于执行非负整数的通常斐波那契表示的加法,我们为其提供了一个新的构造性证明。此外,我们将斐波那契等价的二进制补码表示法刻画为$\mathbb{Z}$与一个特定语言之间的递增双射。
英文摘要:
Using the classic two's complement notation of signed integers, the fundamental arithmetic operations of addition, subtraction, and multiplication are identical to those for unsigned binary numbers. We introduce a Fibonacci-equivalent of the two's complement notation and we show that addition in this numeration system can be performed by a deterministic finite-state transducer. The result is based on the Berstel adder, which performs addition of the usual Fibonacci representations of nonnegative integers and for which we provide a new constructive proof. Moreover, we characterize the Fibonacci-equivalent of the two's complement notation as an increasing bijection between $\mathbb{Z}$ and a particular language.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。