Automata in SageMath---Combinatorics meet Theoretical Computer Science (Q2965981)

From MaRDI portal
Revision as of 14:49, 19 April 2024 by Importer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Automata in SageMath---Combinatorics meet Theoretical Computer Science
scientific article

    Statements

    author
    Clemens Heuberger
    0 references
    Daniel Krenn
    0 references
    Sara Kropf
    0 references
    publication date
    3 March 2017
    0 references
    zbMATH Keywords
    transducer
    0 references
    automaton
    0 references
    non-adjacent form
    0 references
    Hamming weight
    0 references
    tutorial
    0 references
    describes a project that uses
    SageMath
    0 references
    PyOpenFST
    0 references
    FSA
    0 references
    SFST
    0 references
    Vcsn
    0 references
    ASTL
    0 references
    OpenFst
    0 references
    Python
    0 references
    Mathematica
    0 references
    arXiv classification
    cs.FL
    0 references
    math.CO
    0 references

    Identifiers

    zbMATH DE Number
    6691956
    0 references
    arXiv ID
    1404.7458
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2965981&oldid=33595450"
    Powered by MediaWiki