eng
episciences.org
Discrete Mathematics & Theoretical Computer Science
1365-8050
2016-05-10
Vol. 18 no. 3
Analysis of Algorithms
10.46298/dmtcs.1352
1352
journal article
Automata in SageMath---Combinatorics meet Theoretical Computer Science
Clemens Heuberger
Daniel Krenn
Sara Kropf
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.
https://dmtcs.episciences.org/1352/pdf
Computer Science - Formal Languages and Automata Theory
Mathematics - Combinatorics
11A63, 05A16, 68R05