Canonical Zeckendorf Normalization and the Minimal Berstel Adder
Formal language theory and automata
gen2
formal
submitted
The canonical low-to-high Zeckendorf normalization is non-subsequential with exact prefix-destruction index Delta(n)=n. The Berstel transducer is proved minimal with exact state complexity 10 via kern…
RAIRO Theoretical Informatics and Applications Submitted 44 Theorems Formal language theory and automata
Abstract
The canonical low-to-high Zeckendorf normalization is non-subsequential with exact prefix-destruction index Delta(n)=n. The Berstel transducer is proved minimal with exact state complexity 10 via kernel separation.
Keywords: Zeckendorf numeration, transducer theory, subsequential functions, Fibonacci addition, state complexity
Infographic
