Automata in SageMath---Combinatorics meet Theoretical Computer Science
Discrete mathematics & theoretical computer science, Tome 18 (2015-2016) no. 3
Cet article a éte moissonné depuis la source Episciences
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.
@article{DMTCS_2016_18_3_a8,
author = {Heuberger, Clemens and Krenn, Daniel and Kropf, Sara},
title = {Automata in {SageMath---Combinatorics} meet {Theoretical} {Computer} {Science}},
journal = {Discrete mathematics & theoretical computer science},
year = {2015-2016},
volume = {18},
number = {3},
doi = {10.46298/dmtcs.1352},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1352/}
}
TY - JOUR AU - Heuberger, Clemens AU - Krenn, Daniel AU - Kropf, Sara TI - Automata in SageMath---Combinatorics meet Theoretical Computer Science JO - Discrete mathematics & theoretical computer science PY - 2015-2016 VL - 18 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1352/ DO - 10.46298/dmtcs.1352 LA - en ID - DMTCS_2016_18_3_a8 ER -
%0 Journal Article %A Heuberger, Clemens %A Krenn, Daniel %A Kropf, Sara %T Automata in SageMath---Combinatorics meet Theoretical Computer Science %J Discrete mathematics & theoretical computer science %D 2015-2016 %V 18 %N 3 %U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1352/ %R 10.46298/dmtcs.1352 %G en %F DMTCS_2016_18_3_a8
Heuberger, Clemens; Krenn, Daniel; Kropf, Sara. Automata in SageMath---Combinatorics meet Theoretical Computer Science. Discrete mathematics & theoretical computer science, Tome 18 (2015-2016) no. 3. doi: 10.46298/dmtcs.1352
Cité par Sources :