A disambiguation algorithm for weighted automata

DOI10.1016/j.tcs.2016.08.019zbMath1371.68159OpenAlexW2510627344MaRDI QIDQ2357105

Mehryar Mohri, Michael D. Riley

Publication date: 19 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.019

zbMATH Keywords

automata theoryweighted automatarational power seriesweighted automata algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Solving the Weighted HOM-Problem With the Help of Unambiguity ⋮ Noncommutative rational Pólya series ⋮ Disambiguation of weighted tree automata

Uses Software

• OCRopus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• Finding the k Shortest Paths
• Biological Sequence Analysis
• Digital Image Compression
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS

This page was built for publication: A disambiguation algorithm for weighted automata