Automata in SageMath---Combinatorics meet Theoretical Computer Science
Formal Languages and Automata Theory
2023-06-22 v4 Combinatorics
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
Cite
@article{arxiv.1404.7458,
title = {Automata in SageMath---Combinatorics meet Theoretical Computer Science},
author = {Clemens Heuberger and Daniel Krenn and Sara Kropf},
journal= {arXiv preprint arXiv:1404.7458},
year = {2023}
}