Cited in
(33)- Minimizing deterministic weighted tree automata
- Survey: finite-state technology in natural language processing
- scientific article; zbMATH DE number 7488335 (Why is no real title available?)
- A type system for weighted automata and rational expressions
- Pairwise rational kernels obtained by automaton operations
- Compositions of constant weighted extended tree transducers
- Algorithms for probabilistic and stochastic subsequential failure transducers
- A Pushdown Transducer Extension for the OpenFst Library
- Grail
- HFST
- Tiburon
- FIRE station
- TWOLC
- Vaucanson
- FSA
- FAdo
- GUItar
- Carmel
- DRAGON
- FSA
- Kaldi
- ASTL
- PyOpenFST
- SFST
- QUB
- Vcsn
- Implementation of code properties via transducers
- OpenGrm
- From tree automata to string automata minimization
- Extended multi bottom-up tree transducers
- Filters for Efficient Composition of Weighted Finite-State Transducers
- Automata in SageMath -- combinatorics meet theoretical computer science
- HFST Tools for Morphology – An Efficient Open-Source Package for Construction of Morphological Analyzers
This page was built for software: OpenFst
