On Weakly Ambiguous Finite Transducers

DOI10.1007/11779148_15MaRDI QIDQ3617054zbMATH OpenOpenAlexFDO

Authors N. Sântean, Sheng Yu

Publication date 26 March 2009

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11779148_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Nondeterministic bimachines and rational relations with finite codomain
• Decomposing a k-valued transducer into k unambiguous ones
• General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
• A simple method for building bimachines from functional finite-state transducers
• FINITELY SUBSEQUENTIAL TRANSDUCERS

Cited in

(6)

• A unified framework for disambiguating finite transductions
• A simple method for building bimachines from functional finite-state transducers
• Nondeterministic bimachines and rational relations with finite codomain
• Fragile words and Cayley type transducers
• ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
• On the difference set of two transductions

This page was built for publication: On Weakly Ambiguous Finite Transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617054)