A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Automata in SageMath---Combinatorics meet Theoretical Computer Science
2016
Discrete Mathematics & Theoretical Computer Science
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved using SageMath. In particular, we compute the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was not known before.
doi:10.46298/dmtcs.1352
fatcat:n7e6ed3bmbhqdg2ydouozvgilm