A disambiguation algorithm for weighted automata
From MaRDI portal
Recommendations
Cites work
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Biological Sequence Analysis
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- Digital image compression
- Finding the k Shortest Paths
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 2040319 (Why is no real title available?)
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library
Cited in
(7)- Noncommutative rational Pólya series
- Disambiguation of weighted tree automata
- A disambiguation algorithm for finite automata and functional transducers
- On the disambiguation of weighted automata
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- scientific article; zbMATH DE number 1775630 (Why is no real title available?)
- Solving the Weighted HOM-Problem With the Help of Unambiguity
This page was built for publication: A disambiguation algorithm for weighted automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357105)