Automata in SageMath---Combinatorics meet Theoretical Computer Science

zbMath1401.68369arXiv1404.7458MaRDI QIDQ2965981

Sara Kropf, Daniel Krenn, Clemens Heuberger

Publication date: 3 March 2017

Full work available at URL: https://arxiv.org/abs/1404.7458

zbMATH Keywords

Hamming weightautomatontutorialtransducernon-adjacent form

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45)

Related Items (4)

Application of Smirnov words to waiting time distributions of runs ⋮ Analysis of carries in signed digit expansions ⋮ Output sum of transducers: limiting distribution and periodic fluctuation ⋮ Variances and covariances in the central limit theorem for the output of a transducer

Uses Software

• Mathematica
• OpenFst
• SageMath
• Python
• PyOpenFST
• SFST
• Vcsn
• ASTL
• FSA

This page was built for publication: Automata in SageMath---Combinatorics meet Theoretical Computer Science