Results

**1 - 1**of**1**### AUTOMATA AND TRANSDUCERS IN THE COMPUTER ALGEBRA SYSTEM SAGE

"... Abstract. In this tutorial, we demonstrate how easy it is to construct finite state machines, in particular automata and transducers, within the computer algebra system Sage. As a beneficent byproduct, we calculate the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. In this tutorial, we demonstrate how easy it is to construct finite state machines, in particular automata and transducers, within the computer algebra system Sage. As a beneficent byproduct, we calculate the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was not known before. 1.