Automata in SageMath---Combinatorics meet Theoretical Computer Science

Abstract

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.

Keywords

• computer science - formal languages and automata theory
• mathematics - combinatorics
• 11a63, 05a16, 68r05