Vaucanson

swMATH5732MaRDI QIDQ17871FDOQ17871

Author name not available (Why is that?)

Described by source

• Implementation concepts in Vaucanson 2
• Implementation and Application of Automata

Cited In (12)

• An Efficient Computation of the Equation K-automaton of a Regular K-expression
• Introducing VAUCANSON
• An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Implementation of code properties via transducers
• Derived-term automata for extended weighted rational expressions
• A type system for weighted automata and rational expressions
• Derived-term automata of multitape rational expressions
• HFST Tools for Morphology – An Efficient Open-Source Package for Construction of Morphological Analyzers
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• COMPAS -- a computing package for synchronization
• Implementation and Application of Automata

This page was built for software: Vaucanson