A disambiguation algorithm for finite automata and functional transducers
From MaRDI portal
Publication:2914715
DOI10.1007/978-3-642-31606-7_23zbMATH Open1297.68158OpenAlexW169718621MaRDI QIDQ2914715FDOQ2914715
Authors: 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
Recommendations
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- A disambiguation algorithm for weighted automata
- On the disambiguation of weighted automata
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- scientific article; zbMATH DE number 1045406
Cites Work
- Biological Sequence Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Digital image compression
- Sur les rélations rationnelles entre monoides libres
- Weighted automata algorithms
- FINITELY SUBSEQUENTIAL TRANSDUCERS
- 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
Cited In (6)
- Title not available (Why is that?)
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- A unified framework for disambiguating finite transductions
- A disambiguation algorithm for weighted automata
- On the disambiguation of weighted automata
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
This page was built for publication: A disambiguation algorithm for finite automata and functional transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914715)
