Algorithms for weighted finite automata with failure transitions

DOI10.1007/978-3-319-94812-6_5MaRDI QIDQ1616954zbMATH OpenOpenAlexFDO

Authors Cyril Allauzen, Michael D. Riley

Publication date 7 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94812-6_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Learning weighted automata
• Weighted automata algorithms
• scientific article; zbMATH DE number 2150300
• Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
• PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

Cited in

(6)

• Algorithms for probabilistic and stochastic subsequential failure transducers
• Learning weighted automata
• PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
• scientific article; zbMATH DE number 7488335 (Why is no real title available?)
• Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
• Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers

This page was built for publication: Algorithms for weighted finite automata with failure transitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1616954)