FINITELY SUBSEQUENTIAL TRANSDUCERS

DOI10.1142/S0129054103002126zbMath1101.68641MaRDI QIDQ5696948

Mehryar Mohri, Cyril Allauzen

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (6)

Multi-sequential Word Relations ⋮ A Disambiguation Algorithm for Finite Automata and Functional Transducers ⋮ Multi-Sequential Word Relations ⋮ ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS ⋮ An optimal pre-determinization algorithm for weighted transducers ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields

Cites Work

• Unnamed Item
• On the finite-valuedness problem for sequential machines
• Sur une variante des fonctions séquentielles
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Minimization algorithms for sequential transducers
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Economy of description for single-valued transducers
• A note on finite-valued and finitely ambiguous transducers
• A computational method for optimal control of a linear system by quadratic programming†

This page was built for publication: FINITELY SUBSEQUENTIAL TRANSDUCERS