Vaucanson
From MaRDI portal
Cited in
(24)- Implementation and Application of Automata
- 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
- AUTOMATE
- COMPAS
- Grail
- HFST
- OpenFst
- TESTAS
- TWOLC
- FSA
- automata
- FAdo
- GUItar
- SFST
- 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
This page was built for software: Vaucanson
