Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Automata in SageMath ...
Article

Automata in SageMath---Combinatorics meet Theoretical Computer Science

Clemens Heuberger, Daniel Krenn, Sara Kropf
Download article
Open on arXiv
Imported on
May 10, 2016
Published on
May 10, 2016
Last modified on
March 31, 2025
Volume 18
vol. 18:3
Analysis of Algorithms
DOI
10.46298/dmtcs.1352
License
Attribution 4.0 International (CC BY 4.0)
P 24644
Indicators
2308
Views
1484
Downloads

Automata in SageMath---Combinatorics meet Theoretical Computer Science

Clemens Heuberger, Daniel Krenn, Sara Kropf
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
Preview
Loading PDF preview...