Weighted Finite-State Transducer Algorithms. An Overview
暂无分享,去创建一个
[1] Jarkko Kari,et al. Digital Images and Formal Languages , 1997, Handbook of Formal Languages.
[2] Dominique Revuz,et al. Minimisation of Acyclic Deterministic Automata in Linear Time , 1992, Theor. Comput. Sci..
[3] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[4] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[5] Daniel J. Lehmann,et al. Algebraic Structures for Transitive Closure , 1976, Theor. Comput. Sci..
[6] Michael Riley,et al. Speech Recognition by Composition of Weighted Finite Automata , 1996, ArXiv.
[7] Cyril Allauzen,et al. Efficient Algorithms for Testing the Twins Property , 2003, J. Autom. Lang. Comb..
[8] Arto Salomaa,et al. Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.
[9] Mehryar Mohri,et al. Finite-State Transducers in Language and Speech Processing , 1997, CL.
[10] Mehryar Mohri,et al. Semiring Frameworks and Algorithms for Shortest-Distance Problems , 2002, J. Autom. Lang. Comb..
[11] Emmanuel Roche,et al. Finite-State Language Processing , 1997 .
[12] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[13] Jean Berstel,et al. Rational series and their languages , 1988, EATCS monographs on theoretical computer science.
[14] Marcel Paul Schützenberger,et al. Sur une Variante des Fonctions Sequentielles , 1977, Theor. Comput. Sci..
[15] Fernando Pereira,et al. Weighted Automata in Text and Speech Processing , 2005, ArXiv.
[16] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.