Heuberger, Clemens and Krenn, Daniel and Kropf, Sara - Automata in SageMath---Combinatorics meet Theoretical Computer Science

dmtcs:1475 - Discrete Mathematics & Theoretical Computer Science, May 10, 2016, Vol. 18 no. 3
Automata in SageMath---Combinatorics meet Theoretical Computer Science

Authors: Heuberger, Clemens and Krenn, Daniel and Kropf, Sara

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.


Source : oai:arXiv.org:1404.7458
Volume: Vol. 18 no. 3
Section: Analysis of Algorithms
Published on: May 10, 2016
Submitted on: May 10, 2016
Keywords: Computer Science - Formal Languages and Automata Theory,Mathematics - Combinatorics,11A63, 05A16, 68R05


Share

Browsing statistics

This page has been seen 657 times.
This article's PDF has been downloaded 225 times.