On the Disambiguation of Weighted Automata

DOI10.1007/978-3-319-22360-5_22zbMath1465.68164arXiv1405.0500OpenAlexW2293090312MaRDI QIDQ2947428

Mehryar Mohri, Michael D. Riley

Publication date: 23 September 2015

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0500

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Related Items (1)

On the Disambiguation of Weighted Automata

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
• On the Disambiguation of Weighted Automata
• 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: On the Disambiguation of Weighted Automata