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

dmtcs:1352 - Discrete Mathematics & Theoretical Computer Science, May 10, 2016, Vol. 18 no. 3 - https://doi.org/10.46298/dmtcs.1352
Automata in SageMath---Combinatorics meet Theoretical Computer ScienceArticle

Authors: 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://doi.org/10.46298/dmtcs.1352
    Source: 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
    Licence: Attribution 4.0 International (CC BY 4.0)
    Funding:
      Source : OpenAIRE Graph
    • Asymptotic Analysis of Extremal Discrete Structures; Funder: Austrian Science Fund (FWF); Code: P 24644

    Share and export

    Consultation statistics

    This page has been seen 1509 times.
    This article's PDF has been downloaded 844 times.