A Disambiguation Algorithm for Finite Automata and Functional Transducers

DOI10.1007/978-3-642-31606-7_23zbMath1297.68158OpenAlexW169718621MaRDI QIDQ2914715

Mehryar Mohri

Publication date: 20 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les rélations rationnelles entre monoides libres
• A construction on finite automata that has remained hidden
• GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS
• Biological Sequence Analysis
• Weighted Automata Algorithms
• Digital Image Compression
• FINITELY SUBSEQUENTIAL TRANSDUCERS

This page was built for publication: A Disambiguation Algorithm for Finite Automata and Functional Transducers