Automata in SageMath---Combinatorics meet Theoretical Computer Science release_prnbvuqeu5fpdphdhrajffbzta

by Clemens Heuberger, Daniel Krenn, Sara Kropf

Released as a article .

2016  

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.
In text/plain format

Archived Files and Locations

application/pdf  270.8 kB
file_3qbtphohybhvddi7prxt5pwpbu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-05-05
Version   v4
Language   en ?
arXiv  1404.7458v4
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: cc868289-7e18-44e7-ab02-4e0b2e89e97e
API URL: JSON